论文信息 - Non-context-Free Grammars Generating Context-Free Languages

Non-context-Free Grammars Generating Context-Free Languages

If G is a grammar such that in each non-context-free rule of G, the right side contains a string of terminals longer than any terminal string appearing between two nonterminals in the left side, then the language generated by G is context free. Six previous results follow as corollaries of this theorem.

Brenda S. Baker | B. S. Baker

[1] G. H. Matthews. A Note on Assymmetry in Phrase Structure Grammars , 1964, Inf. Control..

[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[3] G. H. Matthews. Two-Way Languages , 1967, Inf. Control..

[4] G. H. Matthews. Discontinuity and Asymmetry in Phrase Structure Grammars , 1963, Information and Control.

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

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