[Haskell-cafe] Parsec-like parser combinator that handles left recursion?

Nils Anders Danielsson nad at Cs.Nott.AC.UK
Wed Dec 9 20:49:56 EST 2009

On 2009-12-09 18:50, Dan Doel wrote:
> (Your parsers aren't PEGs, are they? If so, I apologize for the
> redundancy.)

No, my parsers use Brzozowski derivatives.

See the related work section of the paper I mentioned for some other
parser combinator libraries which can handle (some) left recursive


More information about the Haskell-Cafe mailing list