On Thu, Oct 13, 2016 at 7:43 PM, Aaron Moss <a3m...@uwaterloo.ca> wrote:
> This isn’t strictly true; the lookahead capabilities of PEGs allow some > languages that are not context free to be matched (for instance, a^n b^n > c^n, using the grammar below). Conversely, there is a conjecture (to my > knowledge as yet unproven) that there exist some context free languages for > which no PEG can be devised (given that packrat parsing can match any PEG > in linear time, but there is no known linear-time algorithm for > general-purpose CFG parsing). I didn't know that. Interesting! Thank you! -- Juancarlo *Añez*
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
