Size/lookahead tradeoff for LL(k)-grammars

Information Processing Letters

Volumn 80, Issue 3, 2001, Pages 125-129

  Bertsch, E ^a   Nederhof, M J ^b  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Formal languages; Parsing theory

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFORMATION DISSEMINATION;

GRAMMARS; PARSING THEORY;

FORMAL LANGUAGES;

EID: 9444266568     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(01)00156-9     Document Type: Article

References (4)

1. H. Leung, D. Wotschke, On the size of parsers and LR(k)-grammars, Theoret. Comput. Sci. 242 (2000) 59-69.
2. S. Sippu, E. Soisalon-Soininen, Parsing Theory, Vol. II: LR(k) and LL(k) Parsing, EATCS Monographs on Theoretical Computer Science, Vol. 20, Springer, Berlin, 1990.
3. S. Sippu, E. Soisalon-Soininen, Parsing Theory, Vol. I: Languages and Parsing, EATCS Monographs on Theoretical Computer Science, Vol. 15, Springer, Berlin, 1988.
4. D. Rosenkrantz, P. Lewis II, Deterministic left corner parsing, in: IEEE Conference Record of the 11th Annual Symposium on Switching and Automata Theory, 1970, pp. 139-152.