Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Knuth, D. E.,Top-down syntax analysis, International summer school on computer programming, Copenhagen, 1967.
Korenjack, A. J., and Hopcroft, J. E.,Simple deterministic languages, Proc. 7th symp. switching and automata theory, IEEE, 1966, 36–46.
Kurki-Suonio, R.,On top-to-bottom recognition and left recursion, Comm. ACM 9, July 1966, 527–528.
Kurki-Suonio, R.,A note on LL(1)languages, International summer school on computer programming, Copenhagen, 1967.
Lewis II, P. M., and Stearns, R. E.,Syntax-directed transduction, J. ACM, 15, July 1968, 465–488.
Wood, D.,The theory of left factored languages, To be published in Computer Journal.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kurki-Suonio, R. Notes on top-down languages. BIT 9, 225–238 (1969). https://doi.org/10.1007/BF01946814
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01946814