Pegged v0.4: longest-match, left-recursion, and expandable parse trees

[Moritz Maxeiner via Digitalmars-d-announce]

On Thursday, 2 March 2017 at 20:42:56 UTC, Philippe Sigaud wrote:
> Hi,
>
> Pegged is a parser generator based on Parsing Expression 
> Grammars (PEG) written in D, that aims to be both simple to use 
> and work at compile-time.
>
> See: https://github.com/PhilippeSigaud/Pegged
>
> [...]

Thank you very much for Pegged, if I end up choosing D for the 
implementation part of my master thesis, Pegged will be very 
helpful to me.