Parser combinators for ambiguous left-recursive grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4902 LNCS, Issue , 2007, Pages 167-181

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

^a UNIVERSITY OF WINDSOR   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Ambiguity; Functional programming; Left recursion; Natural language parsing; Parser combinators

Indexed keywords

COMPUTATIONAL COMPLEXITY; NATURAL LANGUAGE PROCESSING SYSTEMS; SPECIFICATIONS;

LEFT RECURSION; NATURAL LANGUAGE PARSING;

FUNCTIONAL PROGRAMMING;

EID: 38549176979     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I: Parsing. Prentice-Hall, Englewood Cliffs (1972)
2. Burge, W.H.: Recursive Programming Techniques. Addison-Wesley, Reading (1975)
3. Carroll, J.: Efficiency in large-scale parsing systems - parser comparison (2003), http://informatics.sussex.ac.uk/research/nlp/carroll/elsps. html
4. Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13(2), 94-102 (1970)
5. Fairburn, J.: Making form follow function: An exercise in functional programming style. Cambridge Comp. Lab. Technical Report No. 89 (1986)
6. Ford, B.: Packrat parsing: Simple, powerful, lazy, linear time. In: ICFP, pp. 36-47 (2002)
7. Frost, R.A.: Realization of natural language interfaces using lazy functional programming. ACM Comp. Surv. 38(4) Article 11 (2006)
8. Frost, R.A.: Using memoization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers. SIGPLAN Notices 29(4), 23-30 (1994)
9. Frost, R.A., Hafiz, R., Callaghan.: Modular and efficient top-down parsing for ambiguous left-recursive grammars. In: Proc. of the Tenth Int. Conf. on Parsing Technologies, pp. 109-120. ACL Press (2007)
10. Frost, R.A., Hafiz, R.: A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time. SIGPLAN Notices 42(5), 46-54 (2006)
11. Hutton, G., Meijer, E.: Monadic parser combinators. J. of Functional Programming 8(4), 437-444 (1995)
12. Johnson, M.: Squibs and discussions: Memoization in top-down parsing. Computational Linguistics 21(3), 405-417 (1995)
13. Kuno, S.: The augmented predictive analyzer for context-free languages -its relative efficiency. Communications of the ACM 9(11), 810-823 (1966)
14. Lickman, P.: Parsing With Fixed Points. Master's Th., Oxford (1995)
15. Nederhof, M.J., Koster, C.H.A.: 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 (1993)
16. Norvig, P.: Techniques for automatic memoization with applications to context-free parsing. Computational Linguistics 17(1), 91-98 (1991)
17. Shiel, B.A.: Observations on context-free parsing. Technical Reports TR 12-76, Center for Research in Computing Technology, Aiken Computational Laboratory, Harvard University (1976)
18. Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Boston, MA (1986)
19. Wadler, P.: How to replace failure by a list of successes. In: Jouannaud, J.-P. (ed.) Functional Programming Languages and Computer Architecture. LNCS, vol. 201, pp. 113-128. Springer, Heidelberg (1985)