Properties of context-free languages and grammars permitting deterministic top-down recognition with bounded lookahead are discussed. In particular, it is shown that for eachk>1 there are such languages requiring a lookahead of at leastk characters.
Key wordsContext-free language top-down lookahead
Unable to display preview. Download preview PDF.
- 1.Knuth, D. E.,Top-down syntax analysis, International summer school on computer programming, Copenhagen, 1967.Google Scholar
- 2.Korenjack, A. J., and Hopcroft, J. E.,Simple deterministic languages, Proc. 7th symp. switching and automata theory, IEEE, 1966, 36–46.Google Scholar
- 4.Kurki-Suonio, R.,A note on LL(1)languages, International summer school on computer programming, Copenhagen, 1967.Google Scholar
- 6.Wood, D.,The theory of left factored languages, To be published in Computer Journal.Google Scholar