I know of languages describable by PEGs but not CFGs (e.g., a^n b^n c^n), but are there any CFL's that cannot be described by a PEG? My quick thought is x x^R (where x is a sequence of symbols, and x^R is the reverse of x).
Cheers, David
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
