Parser Combinators

Some articles on parser, parser combinator, parsers, parser combinators:

Memoization - Some Other Considerations - Parsers
... When a top-down parser tries to parse an ambiguous input with respect to an ambiguous context-free grammar (CFG), it may need an exponential number of steps (with ... automatic memoization to a simple backtracking recursive descent parser to solve the problem of exponential time complexity ... in Norvig’s approach is that when a parser is applied to the input, the result is stored in a memotable for subsequent reuse if the same parser is ever reapplied to the same ...
Parser Combinator
... In functional programming, a parser combinator is a higher-order function which accepts several parsers as input and returns a new parser as its output ... In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the ... Parser combinators enable a recursive descent parsing strategy which facilitates modular piecewise construction and testing ...
Parser Combinator - Shortcomings and Solutions
... Parser combinators, like all recursive descent parsers, are not limited to the context-free grammars and thus do no global search for ambiguities in the LL(k ... In such cases, the recursive descent parser may default (perhaps unknown to the grammar designer) to one of the possible ambiguous paths, resulting in ... The simple implementations of parser combinators have some shortcomings, which are common in top-down parsing ...