Context-dependent grammars
Abstract
This chapter gives an extensive and thorough coverage of grammars that generate languages under various context -related restrictions. First, it covers classical grammars based upon tight context restrictions. Then, it studies context conditional grammars and their variants, including random context grammars, generalized forbidding grammars, semi-conditional grammars, and simple semi-conditional grammars. They all are based upon loose context restrictions. More precisely, they have their rules enriched by permitting and forbidding strings, referred to as permitting and forbidding conditions, respectively. These grammars perform their language-generation process in such a way that they require the presence of permitting conditions and, simultaneously, the absence of forbidding conditions in the rewritten sentential forms.
Related Papers
- → PUZZLE GRAMMARS AND CONTEXT-FREE ARRAY GRAMMARS(1991)33 cited
- → Decision Problems of Phrase-Structure Grammars(1964)29 cited
- → Linear Grammars with One-Sided Contexts and Their Automaton Representation(2014)3 cited
- Generalized Context - Free Grammars, Multiple Context - Free Grammars and Head Grammars(1987)
- → A generalization of the offline parsable grammars(1989)7 cited