Parsing with derivatives: A functional pearl

ACM SIGPLAN Notices

Volumn 46, Issue 9, 2011, Pages 189-195

  Might, Matthew ^a   Darais, David ^a   Spiewak, Daniel ^b  

^a UNIVERSITY OF UTAH   (United States)

^b UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

Context free grammar; Derivative; Formal languages; Parser combinatory; Parsing; Regular expressions

Indexed keywords

DEAD ON ARRIVAL; EQUATIONAL THEORY; FIXED POINTS; FUNCTIONAL APPROACH; FUNCTIONAL CODES; MEMOIZATION; PARSER COMBINATORS; PARSER COMBINATORY; PARSING; REGULAR EXPRESSIONS; THEORY AND PRACTICE;

CONTEXT FREE GRAMMARS; DEBRIS; DERIVATIVES; FORMAL LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 80053368478     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2034574.2034801     Document Type: Conference Paper

References (20)

1. BRZOZOWSKI, J. A. Derivatives of regular expressions. Journal of the ACM 11, 4 (Oct. 1964), 481-494.
2. COCKE, J., AND SCHWARTZ, J. T. Programming languages and their compilers: Preliminary notes. Tech. rep., Courant Institute of Mathematical Sciences, New York University, New York, NY, 1970.
3. COUSOT, P., AND COUSOT, R. Parsing as abstract interpretation of grammar semantics. Theoretical Computer Science 290 (2003), 531-544. (Pubitemid 35264432)
4. COUSOT, P., AND COUSOT, R. Grammar analysis and parsing by abstract interpretation, invited chapter. In Program Analysis and Compilation, Theory and Practice: Essays dedicated to Reinhard Wilhelm, T. Reps, M. Sagiv, and J. Bauer, Eds., LNCS 4444. Springer discretionary-Verlag, Dec. 2006, pp. 178-203.
5. DANIELSSON, N. A. Total parser combinators. In Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (New York, NY, USA, 2010), ICFP '10, ACM, pp. 285-296.
6. DEREMER, F. L. Practical translators for LR(k) languages. Tech. rep., Cambridge, MA, USA, 1969.
7. DIJKSTRA, E. W. Selected Writings on Computing: A Personal Perspective. Springer, Oct. 1982.
8. EARLEY, J. An efficient context-free parsing algorithm. Communications of the ACM 13, 2 (Feb. 1970), 94-102.
9. FLOYD, R. W. Syntactic analysis and operator precedence. Journal of the ACM 10, 3 (July 1963), 316-333.
10. FORD, B. Packrat parsing: Simple, powerful, lazy, linear time. In Proceedings of the 2002 International Conference on Functional Programming (Oct. 2002).
11. KASAMI, T. An efficient recognition and syntax-analysis algorithm for context-free languages. Tech. rep., Air Force Cambridge Research Lab, Bedford, MA, 1965.
12. KNUTH, D. On the translation of languages from left to right. Information and Control 8 (1965), 607-639.
13. OWENS, S., REPPY, J., AND TURON, A. Regular-expression derivatives re-examined. Journal of Functional Programming 19, 02 (2009), 173-190.
14. PRATT, V. R. Top down operator precedence. In POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (New York, NY, USA, 1973), POPL '73, ACM, pp. 41-51.
15. SWIERSTRA, D. S., PABLO, AND SARIAVA, J. Designing and implementing combinator languages. In Advanced Functional Programming (1998), pp. 150-206.
16. SWIERSTRA, S. Combinator parsing: A short tutorial. In Language Engineering and Rigorous Software Development, A. Bove, L. Barbosa, A. Pardo, and J. Pinto, Eds., vol. 5520 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, Berlin, Heidelberg, 2009, ch. 6, pp. 252-300.
17. TOMITA, M. LR parsers for natural languages. In ACL-22: Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics (Morristown, NJ, USA, 1984), Association for Computational Linguistics, pp. 354-357.
18. WARTH, A., DOUGLASS, J. R., AND MILLSTEIN, T. Packrat parsers can support left recursion. In PEPM '08: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semanticsbased Program Manipulation (New York, NY, USA, 2008), ACM, pp. 103-110.
19. WIRTH, N. Compiler Construction (International Computer Science Series), pap/dsk ed. Addison-Wesley Pub (Sd).
20. YOUNGER, D. H. Recognition and parsing of context-free languages in time n3. Information and Control 10, 2 (1967), 189-208.