On Friday 20 October 2006 15:26, Sylvain Schmitz wrote: > You can verify a PEG for ordering issues as well: remember my paper > _Modular Syntax Demands Verification_ > <http://charybde.homeunix.org/~schmitz/pub/modular.pdf>. It presents a > first approach to the problem of verifying PEGs. Furthermore, the > method is presented in parallel with a CFG ambiguity detection > algorithm, and shares a lot with it.
Cool! I remember you mentioning the paper before and intending to take a closer look, but didn't get a chance to until now. That's exactly the kind of analysis I had in mind. I like how you adapted a CFG-oriented algorithm to PEGs by reducing the PEG to a CFG with totally-ordered disambiguation filters over the alternatives. (I've added a pointer to your tech report to my packrat parsing page, BTW.) I hope sometime soon Terence will find time to write up the very interesting analysis algorithms he's been implementing in ANTLR v3 too! [hint, hint] ;) Cheers, Bryan _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
