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

[mogu 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
...

Excellent! I love pegged. Thanks for your brilliant works.