On Sunday, 3 November 2013 at 01:45:23 UTC, Timothee Cour wrote:
> 1)
> The main issue I see with pegged is PEG grammars don't support left
> recursion, so for example will fail on foo[1].bar(2).fun().
> Unless there's a plan to accomodate those, I sense a dead end.
> One can eliminate left recursion but this has issues.
>
> 2)
> There is some material on extending PEG to support those, eg "Left
> Recursion in Parsing Expression Grammars", or code
> https://github.com/orlandohill/peg-left-recursion but I don't know how well
> they work in practice.

Left-recursion for Pegged is in the works: https://github.com/PhilippeSigaud/Pegged/pull/164

:-)

On Sunday, 15 November 2015 at 01:17:47 UTC, Bastiaan Veelo wrote:
> Left-recursion for Pegged is in the works: https://github.com/PhilippeSigaud/Pegged/pull/164
>
> :-)

And merged!: https://github.com/PhilippeSigaud/Pegged/pull/164

Would be nice to have an overview of which languages the, with this change, can be parsed by a Pegged grammar.