Abstract
A method for constructing canonical LL(k) parsers for context-free grammars is presented. This method can be regarded as a dual of the well-known LR(k) parser construction technique involving so-called LR(k) items and viable prefixes. The counterparts of LR(k) items and viable prefixes are called LL(k) items and viable suffixes, respectively. Modifications of the basic method give rise to subclasses of the canonical LL(k) grammars corresponding to the LALR(k) and SLR(k) grammars. The duals of LALR(k) grammars are called LALL(k) grammars and they form a proper subclass of the canonical LL(k) grammars when k>1. The duals of SLR(k) grammars, called SLL(k) grammars, in turn coincide with the so-called strong LL(k) grammars and form a proper subclass of the LALL(k) grammars when k>1.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vol. I: Parsing. Englewood Cliffs, N.J.: Prentice-Hall, 1972.
Aho, A.V., and J.D. Ullman, Principles of Compiler Design. Reading, Mass.: Addison-Wesley Publishing Co., 1977.
Anderson,T., Syntactic Analysis of LR(k) Languages, Ph.D. Thesis, Computing Lab., University of Newcastle upon Tyne, 1972.
DeRemer,F.L., Practical Translators for LR(k) Languages, Ph.D. Thesis and Project MAC Technical Report TR-65, Mass. Inst. of Tech., 1969.
DeRemer, F.L., Simple LR(k) Grammars, Comm. ACM 14, 453–460, 1971.
Fischer,C.N., D.R.Milton and S.B.Quiring, An Efficient Insertion Only Error-Corrector for LL(1) Parsers, in Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 97–103, 1977.
Ghezzi, C., LL(l) Grammars Supporting an Efficient Error Handling, Information Processing Letters 3, 174–176, 1975.
Harrison, M.A., Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesley Publishing Co., 1978.
Knuth, D.E., On the Translation of Languages from Left to Right, Information and Control 8, 607–639, 1965.
LaLonde,W.R., On Directly Constructing LA(k)LR(m) Parsers without Chain Productions, Technical Report No. SE & CS 76-9, Department of Systems Engineering and Computing Science, Carleton University, 1976.
Rosenkrantz, D.J., and R.E. Stearns, Properties of Deterministic Top-Down Grammars, Information and Control 17, 226–256, 1970.
Wood,D., Lecture Notes on Top-Down Syntax Analysis, Computer Science Technical Report 78-CS-12, Department of Applied Mathematics, McMaster University, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sippu, S., Soisalon-Soininen, E. (1979). On constructing LL(k) parsers. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_47
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive