On Restricted Context-Free Grammars

In context-free grammars, each derivation step can be characterized so that (i) a nonterminal of the current sentential form is chosen and (ii) rewritten by a rule. However, it is well-known that context-free grammars are not able to cover all aspects of natural languages and/or programming languages. Therefore, there were defined many grammars with context-free rules and some mechanism controlling the application of rules, e. g., in random context grammars and their variants, a rule is only applicable if the current sentential form contains some letters or subwords and some letters or words do not occur in it. Therefore, in grammars controlled by context, each derivation step can be characterized so that (i) subsets of applicable nonterminals and rules are determined according to the symbols appearing in the current sentential form, (ii) an applicable nonterminal is chosen and (iii) rewritten by an applicable rule.

[1]  Sigrid Ewert,et al.  A shrinking lemma for random forbidding context languages , 2000, Theor. Comput. Sci..

[2]  Sigrid Ewert,et al.  A pumping lemma for random permitting context languages , 2002, Theor. Comput. Sci..

[3]  Gheorghe Paun.  A Variant of Random Context Grammars: Semi-Conditional Grammars , 1985, Theor. Comput. Sci..

[4]  Alexander Meduna,et al.  Grammars with Context Conditions and Their Applications: Meduna/Grammars , 2005 .

[5]  Tomás Masopust.  Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms , 2010, ArXiv.

[6]  Peter R. J. Asveld.  Review of "A. Meduna & M. Svec, Grammars with Context Conditions and Their Applications (2005), J. Wiley, Hoboken, NJ" , 2006 .

[7]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[8]  Martti Penttonen,et al.  One-Sided and Two-Sided Context in Formal Grammars , 1974, Inf. Control..

[9]  Henning Fernau,et al.  Accepting Grammars and Systems: An Overview , 1995, Developments in Language Theory.

[10]  Georg Zetzsche.  On Erasing Productions in Random Context Grammars , 2010, ICALP.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Otto Mayer,et al.  Some Restrictive Devices for Context-Free Grammars , 1972, Inf. Control..

[13]  Tom.  Simple Restriction in Context-Free Rewriting , 2009 .

[14]  Tomás Masopust.  A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions , 2009, LATA.

[15]  Alexander Meduna,et al.  On context-free rewriting with a simple restriction and its computational completeness , 2009, RAIRO Theor. Informatics Appl..

[16]  Alexander Meduna,et al.  Grammars with Context Conditions and Their Applications , 2005 .

[17]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .