Abstract
Usually, a parser for an LL(k)-grammar G is a deterministic pushdown transducer which produces a leftmost derivation for a given input string x ∈ L(G). Ukkonen [5] has given a family of LL(2)- grammars proving that every parser for these grammars has exponential size. If we add to a parser the possibility to manipulate a constant num- ber of pointers which point to positions within the constructed part of the leftmost derivation and to change the output in such positions, we obtain an extended parser for the LL(k)-grammar G. Given an arbitrary LL(k)-grammar G, we will show how to construct an extended parser of polynomial size manipulating at most k 2 pointers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. V. Aho, and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing, Prentice-Hall (1972).
N. Blum, Theoretische Informatik: Eine anwendungsorientierte Einführung, R. Oldenbourg Verlag München Wien (1998).
S. Sippu, and E. Soisalon-Soininen, Parsing Theory, Vol. I: Languages and Parsing, EATCS Monographs on Theoretical Computer Science Vol. 15, Springer (1988).
S. Sippu, and E. Soisalon-Soininen, Parsing Theory, Vol. II: LR(k) and LL(k) Parsing, EATCS Monographs on Theoretical Computer Science Vol. 20, Springer (1990).
E. Ukkonen, Lower bound on the size of deterministic parsers, JCSS 26 (1983), 153–170.
R. Wilhelm, and D. Maurer, Compiler Design, Addison-Wesley (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blum, N. (1999). On Parsing LL-Languages. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-48057-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66652-3
Online ISBN: 978-3-540-48057-0
eBook Packages: Springer Book Archive