A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time

ACM SIGPLAN Notices

Volumn 41, Issue 5, 2006, Pages 46-54

  Frost, Richard A ^a   Hafiz, Rahmatullah ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Backtracking; Left recursion; Memoization; Parser combinators; Top down parsing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA HANDLING; POLYNOMIALS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS;

BACKTRACKING; LEFT-RECURSION; MEMOIZATION; PARSER COMBINATORS; TOP-DOWN PARSING;

ALGORITHMS;

EID: 33748320847     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1149982.1149988     Document Type: Article

References (16)

1. Camarao, C., Figueiredo, L. and Oliveira, R.,H. (2003) Mimico: A Monadic Combinator Compiler Generator. Journal of the Brazilian Computer Society Vol 9(1).
2. Frost, R. A. and Hafiz, R. (2006) Using monads to accommodate ambiguity and left recursion with parser combinators. Technical Report 06-007 School of Computer Science, University of Windsor, Canada.
3. Frost, R. A. (2003) Monadic memoization - Towards Correctness-Preserving Reduction of Search. AI 2003 eds. Y. Xiang and B. Chaib-draa. LNAI 2671 66-80.
4. Frost, R. A. (1993) Guarded attribute grammars. Software Practice and Experience. 23 (10) 1139-1156.
5. Hutton, G. (1992) Higher-order functions for parsing. J. Functional Programming 2 (3) 323-343.
6. Johnson, M. (1995) Squibs and Discussions: Memoization in top-down parsing. Computational Linguistics 21 (3) 405-417.
7. Koopman, P. and Plasmeijer, R. (1999) Efficient combinator parsers. In Implementation of Functional Languages, LNCS, 1595:122 138. Springer-Verlag.
8. Koskimies, K. (1990) Lazy recursive descent parsing for modular language implementation. Software Practice and Experience, 20 (8) 749-772.
9. Kuno, S. (1965) The predictive analyzer and a path elimination technique. Communications of the ACM 8(7) 453-462.
10. Leermakers, R. (1993) The Functional Treatment of Parsing. Kluwer Academic Publishers, ISBN 0-7923-9376-7.
11. Lickman, P. (1995) Parsing With Fixed Points. Master's Thesis, University of Cambridge.
12. Nederhof, M. J. and Koster, C. H. A. (1993) Top-Down Parsing for Left-recursive Grammars. Technical Report 93-10 Research Institute for Declarative Systems, Department of Informatics, Faculty of Mathematics and Informatics, Katholieke Universiteit, Nijmegen.
13. Norvig, P. (1991) Techniques for automatic memoisation with applications to context-free parsing. Computational Linguistics 17 (1) 91-98.
14. Shiel, B. A. 1976 Observations on context-free parsing. Technical Report TR 12-76, Center for Research in Computing Technology, Aiken Computational Laboratory, Harvard University.
15. Tomita, M. (1985) Efficient Parsing for Natural Language. Kluwer, Boston, MA.
16. Wadler, P. (1985) How to replace failure by a list of successes, in P. Jouannaud (ed.) Functional Programming Languages and Computer Architectures Lecture Notes in Computer Science 201, Springer-Verlag, Heidelberg, 113.