Chapter PDF
Keywords
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.
Bibliografty
A.V. Aho, J.D. Ullman: The Theory of Parsing, Translation and Compiling, vol. 1 (1972), vol. 2 (1973), Prentice-Hall, Englewood Cliffs.
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.
P.M. Lewis, R.E. Stearns: Syntax-directed transduction, Journal ACM, 1968, vol. 15:3, pp. 464–488.
D.J. Rosenkrantz, R.E. Stearns: Properties of deterministic top-down grammars, Information and Control, 1970, vol. 17:3, pp. 226–256.
D. Wood: A further note on TD deterministic languages, Computer Journal, 1971, vol. 14, pp. 396–403.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Streinu, I. (1977). LL(k) languages are closed under union with finite languages. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_39
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive