A generalization of leftmost derivations
- 21 Downloads
A generalization of leftmost derivation called depth-first derivation is defined. The main result, that the depth-first derivations of an arbitrary phrase-structure grammar generate a context-free language, is proved using a new technique in which families of equivalent depth-first derivations of one grammar are represented by single productions in a new grammar. This result is related to several others, including an analogous result for leftmost derivations, through the theorem of B. Baker  that every terminal-bounded grammar generates a context-free language.
KeywordsComputational Mathematic Analogous Result Single Production Leftmost Derivation
Unable to display preview. Download preview PDF.
- 1.B. Baker, Non-context-free grammars generating context-free languages,Information and Control 24 (1974), 231–246.Google Scholar
- 2.R. J. Evey, The theory and application of pushdown store machines,Harvard Univ. Comp. Lab. Report NSF-10, May 1963.Google Scholar
- 3.S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw Hill, New York, 1966.Google Scholar
- 4.S. Ginsburg andE. H. Spanier, Control sets on grammars,Mathematical Systems Theory 2 (1968), 159–177.Google Scholar
- 5.M. Luker, A characterization of the derivation-bounded languages (to be submitted for publication).Google Scholar