Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Compiler Design
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
On LR(k)-parsers of polynomial size
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 5.23 |
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&egr;. L(G). Ukkonen (JCCS 26(1983)153-170) 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 number 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 k2 pointers. Copyright 2001 Elsevier Science B.V.