LL(*): The foundation of the ANTLR parser generator

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2011, Pages 425-436

  Parr, Terence ^a   Fisher, Kathleen ^b  

^a UNIVERSITY OF SAN FRANCISCO   (United States)

^b TUFTS UNIVERSITY   (United States)

Author keywords

augmented transition networks; backtracking; context sensitive parsing; deterministic finite automata; glr; memoization; nondeterministic parsing; peg; semantic predicates; subset construction; syntactic predicates

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONTEXT FREE LANGUAGES; CONTEXT SENSITIVE LANGUAGES; SEMANTICS;

AUGMENTED TRANSITION NETWORKS; BACKTRACKING; CONTEXT-SENSITIVE; CONTEXT-SENSITIVE PARSING; DETERMINISTIC FINITE AUTOMATA; GLR; MEMOIZATION; NONDETERMINISTIC PARSING; PEG; SEMANTIC PREDICATES; SUBSET CONSTRUCTIONS; SYNTACTIC PREDICATE;

SYNTACTICS;

EID: 79959911655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993548     Document Type: Conference Paper

References (20)

1. Appendix. http://antlr.org/papers/LL-star/index.html.
2. BERMUDEZ, M. E., AND SCHIMPF, K. M. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences 41, 2 (1990), 230-250.
3. CHARLES, P. A Practical Method for Constructing Efficient LALR(K) Parsers with Automatic Error Recovery. PhD thesis, New York University, New York, NY, USA, 1991.
4. COHEN, R., AND CULIK, K. LR-Regular grammars an extension of LR(k) grammars. In SWAT '71: Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971) (Washington, DC, USA, 1971), IEEE Computer Society, pp. 153-165.
5. EARLEY, J. An e cient context-free parsing algorithm. Communications of the ACM 13, 2 (1970), 94-102.
6. FORD, B. PACKRAT Parsing: Simple, powerful, lazy, linear time. In Proceedings of annual ACM SIGPLAN International Conference on Functional Programming (2002), ACM Press, pp. 36-47.
7. FORD, B. Parsing Expression Grammars: A recognition-based syntactic foundation. In POPL '04: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages (2004), ACM Press, pp. 111-122.
8. GRIMM, R. Better extensibility through modular syntax. In PLDI'06: Proceedings of annual ACM SIGPLAN Conference on Programming Language Design and Implementation (2006), ACM Press, pp. 38-51.
9. HANSON, D. R. Compact recursive-descent parsing of expressions. Software Practice and Experience 15 (December 1985), 1205-1212.
10. JARZABEK, S., AND KRAWCZYK, T. LL-Regular grammars. Information Processing Letters 4, 2 (1975), 31-37.
11. JIM, T., MANDELBAUM, Y., AND WALKER, D. Semantics and algorithms for data-dependent grammars. In POPL '10: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages (New York, NY, USA, 2010), ACM, pp. 417-430.
12. MCPEAK, S., AND NECULA, G. C. Elkhound: A fast, practical GLR parser generator. In Compiler Construction (2004), pp. 73-88.
13. MILTON, D. R., AND FISCHER, C. N. LL(k) parsing for attributed grammars. In International Conference on Automata, Languages, and Programming (1979), pp. 422-430.
14. NEDERHOF, M.-J. Practical experiments with regular approximation of context-free languages. Computational Linguistics 26, 1 (2000), 17-44.
15. NIJHOLT, A. On the parsing of LL-Regular grammars. In Mathematical Foundations of Computer Science 1976 (Heidelberg, 1976), A. Mazurkiewicz, Ed., vol. 45 of Lecture Notes in Computer Science, Springer Verlag, pp. 446-452.
16. PARR, T. J. Obtaining practical variants of LL(k) and LR(k) for k > 1 by splitting the atomic k-tuple. PhD thesis, Purdue University, West Lafayette, IN, USA, 1993.
17. PARR, T. J., AND QUONG, R. W. Adding Semantic and Syntactic Predicates to LL(k) - pred-LL(k). In Proceedings of the International Conference on Compiler Construction; Edinburgh, Scotland (April 1994).
18. POPLAWSKI, D. A. On LL-Regular grammars. Journal of Computer and System Sciences 18, 3 (1979), 218-227.
19. TOMITA, M. Efficient Parsing for Natural Language. Kluwer Academic Publishers, 1986.
20. WOODS, W. A. Transition network grammars for natural language analysis. Communications of the ACM 13, 10 (1970), 591-606.