Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)
Ch(k) grammars: A characterization of LL(k) languages
KeywordsDerivation Tree General String Distinct Production Start Symbol Parsing Algorithm
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.
Unable to display preview. Download preview PDF.
- 1.A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vols 1 and 2, Prentice Hall, Englewood Cliffs, N.J., 1972 and 1973.Google Scholar
- 2.B.M. Brosgol, Deterministic translation grammars, Proc. 8th Princeton Conf. on Information Sciences and Systems 1974, pp. 300–306.Google Scholar
- 3.A.J. Demers, Generalized left corner parsing, Conf. Record of the 4th ACM Sympos. on Principles of Programming Languages 1977, pp. 170–182.Google Scholar
- 4.M. Hammer, A new grammatical transformation into LL(k) form, Conf. Record of the 6th Annual ACM Sympos. on Theory of Computing 1974, pp. 266–275.Google Scholar
- 6.A. Nijholt, Simple chain grammars and languages, to appear in Theoretical Computer Science.Google Scholar
- 7.D.J. Rosenkrantz and P.M. Lewis, Deterministic left-corner parsing, IEEE Conf. Record of the 11th Annual Sympos. on Switching and Automata Theory 1970, pp. 139–152.Google Scholar
- 8.E. Soisalon-Soininen, Characterization of LL(k) languages by restricted LR(k) grammars, Ph.D. Thesis, Report A-1977-3, Department of Computer Science, University of Helsinki.Google Scholar
- 9.E. Soisalon-Soininen and E. Ukkonen, A characterization of LL(k) languages, in: Automata, Languages and Programming (eds. S. Michaelson and R. Milner), Third Colloquim, Edinburgh University Press, Edinburgh, 1976, pp. 20–30.Google Scholar
© Springer-Verlag Berlin Heidelberg 1979