Advertisement

BIT Numerical Mathematics

, Volume 9, Issue 3, pp 225–238 | Cite as

Notes on top-down languages

  • R. Kurki-Suonio
Article

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.

Key words

Context-free language top-down lookahead 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Knuth, D. E.,Top-down syntax analysis, International summer school on computer programming, Copenhagen, 1967.Google Scholar
  2. 2.
    Korenjack, A. J., and Hopcroft, J. E.,Simple deterministic languages, Proc. 7th symp. switching and automata theory, IEEE, 1966, 36–46.Google Scholar
  3. 3.
    Kurki-Suonio, R.,On top-to-bottom recognition and left recursion, Comm. ACM 9, July 1966, 527–528.CrossRefGoogle Scholar
  4. 4.
    Kurki-Suonio, R.,A note on LL(1)languages, International summer school on computer programming, Copenhagen, 1967.Google Scholar
  5. 5.
    Lewis II, P. M., and Stearns, R. E.,Syntax-directed transduction, J. ACM, 15, July 1968, 465–488.CrossRefGoogle Scholar
  6. 6.
    Wood, D.,The theory of left factored languages, To be published in Computer Journal.Google Scholar

Copyright information

© BIT Foundations 1969

Authors and Affiliations

  • R. Kurki-Suonio
    • 1
  1. 1.University of TampereTampereFinland

Personalised recommendations