Parser Combinators for Ambiguous Left-Recursive Grammars

2007/12/19 by Richard Frost, Richard A. Frost, Rahmatullah Hafiz +2 · 20 citations
Computer Science · #Combinatory logic #Computer science #Context-free grammar #Executable #Functional programming #Haskell #L-attributed grammar #Logic, programming, and type systems #Natural Language Processing Techniques #Natural language processing #Parsing #Parsing expression grammar #Programming language #Rule-based machine translation #semigroups and automata theory

paper · doi:10.1007/978-3-540-77442-6_12

published in Lecture Notes in Computer Science, 167-181 (Springer Berlin Heidelberg)

openalex publication_date 2007/12/19 · crossref created 2007/12/19 · crossref deposited 2021/04/27 · openalex created_date 2025/10/10 · crossref indexed 2025/12/13 · openalex updated_date 2026/07/29

Citations

• Memoization of Top Down Parsing
• A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time
• How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages

Cited by

• Parser combinator [wikipedia]