NASA NTRS · 19720021511
Arbitrary grammars generating context-free languages
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.
Keep this discovery
Explore connections, maps & timelines
Baker, B. S.. 1972-06-14. Arbitrary grammars generating context-free languages. https://ntrs.nasa.gov/citations/19720021511
Cite the original work for its findings. Save a collection to share your selection of sources.