A question that often arises in Web circles like Slashdot is what is the relation of PEG languages to other well known sets like LL, LR, or even CFG (and there's LSTAR and ALLSTAR).
I think that a PEG grammar is not a CFG grammar in the strict sense because of PEG's rule/production ordering. My question is about the set of languages that can be parsed. Intuition tells me that the L(PEG) is larger than LL and LR, but I haven't found a proof for it. Cheers, -- Juancarlo *Añez*
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
