On Tue, Nov 5, 2013 at 6:39 PM, Martin Nowak <code@dawg.eu> wrote:

Like many others I'm hoping for a nice general parser generator for quite some time.
So I'm also asking specifically about your insights on PEGs.
>From what I know they do have some memory issues due to the backtrace memoization (only for deep parse trees though, which aren't common in programming languages). Also it seems that the research community has some issues to formalize PEGs and what grammars they are capable to handle.

IIRC, they don't fit exactly inside the Chomsky hierarchy. But then, so do other grammars and parsing algorithms.

Also why is the expr grammar example so complicated?

What do you mean?