Parsing expression grammars: A recognition-based syntactic foundation

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 111-122

  Ford, Bryan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

BNF; Context free grammars; GTDPL; Lexical analysis; Packrat parsing; Parsing expression grammars; Regular expressions; Scannerless parsing; Syntactic predicates; TDPL; Unified grammars

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SIMULATION; FORMAL LANGUAGES; HIERARCHICAL SYSTEMS; MACHINE ORIENTED LANGUAGES; MATHEMATICAL OPERATORS; NETWORK PROTOCOLS;

LEXICAL ANALYSIS; PACKRAT PARSING; PARSING EXPRESSION GRAMMARS; RECOGNITION BASED SYNTACTIC FOUNDATION; REGULAR EXPRESSIONS; SCANNERLESS PARSING; SYNTACTIC PREDICATES; UNIFIED GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 1442287671     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964011     Document Type: Conference Paper

References (30)

1. Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.
2. Alfred V. Aho. Indexed grammars - an extension of context-free grammars. Journal of the ACM, 15(4):647-671, October 1968.
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. The TMG Recognition Schema. PhD thesis, Princeton University, February 1970.
5. Alexander Birman and Jeffrey D. Ullman. Parsing algorithms with backtrack. Information and Control, 23(1):1-34, August 1973.
6. Claus Brabrand, Michael I. Schwartzbach, and Mads Vangaard. The metafront system: Extensible parsing and transformation. In Third Workshop on Language Descriptions, Tools and Applications, Warsaw, Poland, April 2003.
7. Bryan Ford. Packrat parsing: a practical linear-time algorithm with backtracking. Master's thesis, Massachusetts Institute of Technology, Sep 2002.
8. Bryan Ford. Packrat parsing: Simple, powerful, lazy, linear time. In Proceedings of the 2002 International Conference on Functional Programming, Oct 2002.
9. Dick Grune and Ceril J.H. Jacobs. Parsing Techniques - A Practical Guide. Ellis Horwood, Chichester, England, 1990.
10. J. Heering, P. R. H. Hendriks, P. Klint, and J. Rekers. The syntax definition formalism SDF - reference manual -. SIGPLAN Notices, 24(11):43-75, 1989.
11. Simon Peyton Jones and John Hughes (editors). Haskell 98 Report, 1998. http://www.haskell.org.
12. Aravind K. Joshi and Yves Schabes. Tree-adjoining grammars. Handbook of Formal Languages, 3:69-124, 1997.
13. C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, ALGOL 68 Implementation, pages 95-109, Amsterdam, 1971. North-Holland Publ. Co.
14. Lillian Lee. Fast context-free grammar parsing requires fast boolean matrix multiplication. Journal of the ACM, 49(1):1-15, 2002.
15. Daan Leijen. Parsec, a fast combinator parser. http://www.cs.uu.nl/-daan.
16. Sun Microsystems. Java compiler (JavaCC). https://javacc.dev.java.net/.
17. Sun Microsystems. JavaCC: LOOKAHEAD minitutorial. https://javacc.dev.java.net/doc/lookahead.html.
18. Alexander Okhotin. Conjunctive grammars. Journal of Automata, Languages and Combinatorics, 6(4):519-535, 2001.
19. International Standards Organization. Syntactic metalanguage - Extended BNF, 1996. ISO/IEC 14977.
20. Terence J. Parr and Russell W. Quong. Adding semantic and syntactic predicates to LL(k) - pred-LL(k). In Proceedings of the International Conference on Compiler Construction, Edinburgh, Scotland, April 1994.
21. Terence J. Parr and Russell W. Quong. ANTLR: A Predicated-LL(k) parser generator. Software Practice and Experience, 25(7):789-810, 1995.
22. 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.
23. Amir Shpilka. Lower bounds for matrix product. In IEEE Symposium on Foundations of Computer Science, pages 358-367, 2001.
24. Edward Stabler. Derivational minimalism. Logical Aspects of Computational Linguistics, pages 68-95, 1997.
25. Bjarne Stroustrup. The C++ Programming Language. Addison-Wesley, 3rd edition, June 1997.
26. Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295-320, Oct 1979.
27. 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.
28. A. van Wijngaarden, B.J. Mailloux, J.E.L. Peck, C.H.A. Koster, M. Sintzoff, C.H. Lindsey, L.G.L.T. Meertens, and R.G. Fisker, Report on the algorithmic language ALGOL 68. Numer. Math., 14:79-218, 1969.
29. Eelco Visser. A family of syntax definition formalisms. Technical Report P9706, Programming Research Group, University of Amsterdam, 1997.
30. Niklaus Wirth. What can we do about the unnecessary diversity of notation for syntactic descriptions. Communications of the ACM, 20(11):822-823, November 1977.