LL(k) languages are closed under union with finite languages

  • Ileana Streinu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


Algebraic Property Regular Language Closure Property Cient Condition Usual Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    A.V. Aho, J.D. Ullman: The Theory of Parsing, Translation and Compiling, vol. 1 (1972), vol. 2 (1973), Prentice-Hall, Englewood Cliffs.Google Scholar
  2. [2]
    E.J. Bordier, E.H. Saya: A necessary and sufficient condition for a power language to be LL(k), Computer Journal, 1973, vol. 16, pp. 451–456.Google Scholar
  3. [3]
    P.M. Lewis, R.E. Stearns: Syntax-directed transduction, Journal ACM, 1968, vol. 15:3, pp. 464–488.Google Scholar
  4. [4]
    D.J. Rosenkrantz, R.E. Stearns: Properties of deterministic top-down grammars, Information and Control, 1970, vol. 17:3, pp. 226–256.Google Scholar
  5. [5]
    D. Wood: A further note on TD deterministic languages, Computer Journal, 1971, vol. 14, pp. 396–403.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ileana Streinu
    • 1
  1. 1.Faculty of MathematicsUniversity of BucharestBucurestiRomania

Personalised recommendations