Parser Combinators for Ambiguous Left-Recursive Grammars
Authors:
- 19 December 2007
- book chapter
- Published by Springer Nature
- p. 167-181
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Modular and efficient top-down parsing for ambiguous left-recursive grammars2007
- Realization of natural language interfaces using lazy functional programmingACM Computing Surveys, 2006
- A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial timeACM SIGPLAN Notices, 2006
- Packrat parsing:ACM SIGPLAN Notices, 2002
- Monadic parsing in HaskellJournal of Functional Programming, 1998
- Using memorization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsersACM SIGPLAN Notices, 1994
- Efficient Parsing for Natural Language1986
- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languagesLecture Notes in Computer Science, 1985
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- The augmented predictive analyzer for context-free languages—its relative efficiencyCommunications of the ACM, 1966