Work

Arbitrary grammars generating context-free languages

Year: 1972
Type: article
Abstract: If G is a grammar such that in each noncontext-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 simple corollaries of this theorem.
Institution: Harvard University
Language: English
Open Access status: green
OpenAlex ID: W152059245
FWCI:
Cites: 6
Cited by: 2
Related to: 10