Parser Combinators for Ambiguous Left-Recursive Grammars
Parser combinators are higher-order functions used to build parsers as executable specifications of grammars. Some existing implementations are only able to handle limited ambiguity, some have exponential time and/or space complexity for ambiguous input, most cannot accommodate left-recursive grammars. This paper describes combinators, implemented in Haskell, which overcome all of these limitations.
KeywordsParser combinators ambiguity left recursion functional programming natural-language parsing
Unable to display preview. Download preview PDF.