Modular and efficient top-down parsing for ambiguous left-recursive grammars

IWPT 2007 - Proceedings of the 10th International Conference on Parsing Technologies

Volumn , Issue , 2007, Pages 109-120

  Frost, Richard A ^a   Hafiz, Rahmatullah ^a   Callaghan, Paul C ^b  

^a UNIVERSITY OF WINDSOR   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING; SPECIFICATIONS;

BACKTRACKING SEARCH; DEFINITE-CLAUSE GRAMMARS; EXECUTABLE SPECIFICATIONS; EXPONENTIALS; LEFT-RECURSION; LOGIC-PROGRAMMING; MODULARS; PARSER COMBINATORS; TOP-DOWN PARSING; TOPDOWN;

FUNCTIONAL PROGRAMMING;

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

References (20)

1. Aho, A. V. and Ullman, J. D. (1972) The Theory of Parsing, Translation, and Compiling. Volume I: Parsing. Prentice-Hall.
2. Aho, A. V., Sethi, R. and Ullman, J. D. (1986) Compilers: Principles, Techniques and Tools. Addison-Wesley Longman Publishing Co.
3. Camarao, C., Figueiredo, L. and Oliveira, R., H. (2003) Mimico: A Monadic Combinator Compiler Generator. Journal of the Brazilian Computer Society 9(1).
4. Earley, J. (1970) An efficient context-free parsing algorithm.Comm. ACM 13(2) 94–102.
5. Eijck, J. van (2003) Parser combinators for extraction. In Paul Dekker and Robert van Rooy, editors, Proceedings of the Fourteenth Amsterdam Colloqium ILLC, University of Amsterdam. 99–104.
6. Frost, R. A. (2006) Realization of Natural-Language Interfaces using Lazy Functional Programming. ACM Com-put. Surv. 38(4).
7. Frost, R. A. and Hafiz, R. (2006) A New Top-Down Parsing Algorithm to Accommodate Ambiguity and Left Recursion in Polynomial Time. SIGPLAN Notices 42 (5) 46–54.
8. Hutton, G. (1992) Higher-order functions for parsing. J. Functional Programming 2 (3) 323–343.
9. Johnson, M. (1995) Squibs and Discussions: Memoization in top-down parsing. Computational Linguistics 21(3) 405–417.
10. Kay, M. (1980) Algorithm schemata and data structures in syntactic processing. Technical Report CSL-80–12, XEROX Palo Alto Research Center.
11. Koskimies, K. (1990) Lazy recursive descent parsing for modular language implementation. Software Practice and Experience 20 (8) 749–772.
12. Kuno, S. (1965) The predictive analyzer and a path elimination technique. Comm. ACM 8(7) 453–462.
13. Leermakers, R. (1993) The Functional Treatment of Parsing. Kluwer Academic Publishers, ISBN0–7923–9376–7.
14. Lickman, P. (1995) Parsing With Fixed Points. Master’s Thesis, University of Cambridge.
15. Moore, R. C. (2000) Removing left recursion from context-free grammars. In Proceedings, 1st Meeting of the North American Chapter of the Association for Computational Linguistics, Seattle, Washington, ANLP–NAACL 2000. 249–255.
16. Nederhof, M. J. and Koster, C. H. A. (1993) Top-Down Parsing for Left-recursive Grammars. TechnicalReport 93–10 Research Institute for Declarative Systems, Department of Informatics, Faculty of Mathematics and Informatics, Katholieke Universiteit, Nijmegen.
17. Norvig, P. (1991) Techniques for automatic memoisation with applications to context-free parsing. Computational Linguistics 17(1) 91–98.
18. 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.
19. Tomita, M. (1986) Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Boston, MA.
20. Wadler, P. (1995) Monads for functional programming, Proceedings of the Baastad Spring School on Advanced Functional Programming, ed J. Jeuring and E. Meijer. Springer Verlag LNCS 925.