https://jeffreykegler.github.io/Marpa-web-site/ http://savage.net.au/Marpa.html
http://loup-vaillant.fr/tutorials/earley-parsing/parser
Once you have a successful parse, extracting the tree from it is a little bit like pulling teeth. You have to perform searches on the Early set data, and deal with ambiguities at that point.
None of the mainstream method have any major difficulty with popping out abstract syntax trees in a straightforward syntax-directed manner.
I do not uderstand why PEG is so persistently misunderstood and unjustly criticised.
You have to learn a bit about transforming the target language into the required form. But they are nice because they require no tools at all. Being hand-created, they can be among the most efficient available.
This link seems to have good info on language operations required to put language in the required form.
http://www.cs.engr.uky.edu/~lewis/essays/compilers/rec-des.h...
Having said that, a hand written parser _will_ beat LL(1) (or any parser generator for that matter) when it comes to error reporting, though this depends on the amount of effort a programmer put in to the error reporting.
> or any parser generator for that matter
PEG-based generators can be just as good as handcrafted ones.