Terminal Context in Context-Sensitive Grammars | Zendy

Ronald V. Book | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Terminal Context in Context-Sensitive Grammars

Author(s) -

Ronald V. Book

Publication year - 1972

Publication title -

siam journal on computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.533

H-Index - 122

eISSN - 1095-7111

pISSN - 0097-5397

DOI - 10.1137/0201003

Subject(s) - context (archaeology) , grammar , string (physics) , context sensitive grammar , rewriting , context free grammar , tree adjoining grammar , programming language , computer science , linguistics , natural language processing , parsing , mathematics , history , philosophy , archaeology , mathematical physics

If every non-context-free rewriting rule of a context-sensitive (with erasing) grammar has as left context a string of terminal symbols and the left context is at least as long as the right context, then the language generated is context-free. If every non-context-free rewriting rule of a context-sensitive (with erasing) grammar has as left and right context strings of terminal symbols, then the language generated is context-free.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research