Re: [Haskell-cafe] Parser left recursion

Hi, Roman Cheplyaka wrote:

Another workaround is to use memoization of some sort — see e.g. GLL ("Generalized LL") parsing.

Is there a GLL parser combinator library for Haskell? I know about the gll-combinators for Scala, but havn't seen anything for Haskell. Bonus points for providing the graph-structured stack (for maximal sharing in the computation) and the shared packed parse forest (for maximal sharing in the results) as reusable components. Tillmann