Packrat parsing: Simple, powerful, lazy, linear time - Functional pearl

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 36-47

  Ford, Bryan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING; FORMAL LANGUAGES; FORMAL LOGIC; SYNTACTICS;

BACKTRACKING; LEXICAL ANALYSIS; MEMOIZATION; PACKRAT PARSING; PARSER COMBINATORS; SCANNERLESS PARSING; TOP-DOWN PARSING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036954514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.
2. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
3. Alfred V. Aho and Jeffrey D. Ullman. The Theory of Parsing, Translation and Compiling - Vol. I: Parsing. Prentice Hall, Englewood Cliffs, N.J., 1972.
4. Alexander Birman and Jeffrey D. Ullman. Parsing algorithms with backtract. Information and Control, 23(1):1-34, Aug 1973.
5. Dmitri Bronnikov. Free Yacc-able Java(tm) grammar, 1998. http://home.inreach.com/bronikov/grammars/java.html.
6. Carlos Camarao and Lucilia Figueiredo. A monadic combinator compiler compiler. In 5th Brazilian Symposium on Programming Languages, Curitiba - PR - Brazil, May 2001. Universidade Federal do Paraná.
7. Luca Cardelli, Florian Matthens, and Martin Abadi. Extensible syntax with lexical scoping. Technical Report 121, Digital Systems Research Center, 1994.
8. Jeroen Fokker, Functional parsers. In Advanced Functional Programming, pages 1-23, 1995.
9. Bryan Ford. Packrat parsing: a practical linear-time algorithm with backtracking. Master's thesis, Massachusetts Institute of Technology, Sep 2002.
10. Andy Gill and Simon Marlow. Happy: The parser generator for Haskell. http://www.haskell.org/happy.
11. Graham Hutton and Erik Meijer. Monadic parsing in Haskell. Journal of Functional Programming, 8(4):437-444, Jul 1998.
12. Lillian Lee. Fast context-free grammar parsing requires fast boolean matrix multiplication. Journal of the ACM, 2002. To appear.
13. Daan Leijen. Parsec, a fast combinator parser. http://www.cs.uu.nl/~daan.
14. Terence J. Parr and Russell W. Quong. Adding semantic and syntactic predicates to LL(k): pred-LL(k). In Computational Complexity, pages 263-277, 1994.
15. Terence J. Parr and Russell W. Quong. ANTLR: A predicated-LL(k) parser generator. Software Practice and Experience, 25(7):789-810, 1995.
16. Terence John Parr. Obtaining practical variants of LL(k) and LR(k) for k > 1 by splitting the atomic k-tuple. PhD thesis, Purdue University, Apr 1993.
17. Peter Pepper. LR parsing = grammar transformation + LL parsing: Making LR parsing more understandable and more efficient. Technical Report 99-5, TU Berlin, Apr 1999.
18. Daniel J. Salomon and Gordon V. Cormack. Scannerless NSLR(1) parsing of programming languages. In Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), pages 170-178, Jul 1989.
19. Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295-320, Oct 1979.
20. Masaru Tomita. Efficient parsing for natural language. Kluwer Academic Publishers, 1985.
21. M.G.J. van den Brand, J. Scheerder, J.J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction, 2002.
22. Eelco Visser. Scannerless generalized-LR parsing. Technical Report P9707, Programming Research Group, University of Amsterdam, 1997.
23. Philip Wadler. How to replace failure by a list of successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages. In Functional Programming Languages and Computer Architecture, pages 113-128, 1985.