A General Class of Noncontext Free Grammars Generating Context Free Languages

The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate only context free languages, and that all context free grammars can be converted to equivalent SVMT-bounded grammars. It is also shown that the property of SVMT-boundedness can sometimes be used to conclude that a given language is context free while certain previous results cannot be used for this purpose.

[1]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[2]  Brenda S. Baker,et al.  Non-context-Free Grammars Generating Context-Free Languages , 1974, Inf. Control..

[3]  Ronald V. Book.  Terminal Context in Context-Sensitive Grammars , 1972, SIAM J. Comput..

[4]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[5]  W. A. Martin,et al.  Parsing , 1980, ACL.

[6]  Seymour Ginsburg,et al.  Mappings which Preserve Context Sensitive Languages , 1966, Inf. Control..