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

2017-03-03 Thread Bastiaan Veelo via Digitalmars-d-announce
On Friday, 3 March 2017 at 20:37:33 UTC, Philippe Sigaud wrote: Thank you all for the positive comments! Indeed, I subscribe to that! (Literally, I am subscribed to this thread :-))

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

2017-03-03 Thread Philippe Sigaud via Digitalmars-d-announce
Thank you all for the positive comments!

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

2017-03-03 Thread 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

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

2017-03-02 Thread lobo 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. [...] Thanks! This is my all time favourite D library.

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

2017-03-02 Thread 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 pegge

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

2017-03-02 Thread Philippe Sigaud via Digitalmars-d-announce
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 To use Pegged, just call the grammar function with a PEG and mix it in your module. For exampl