> Does anyone have a good example of a parsing expression language that > *requires* exponential time to parse via recursive descent?
I asked this exact question back in 2009! Bryan Ford replied with this grammar: S <- A* !. A <- a S b / a S c / a I can confirm that this exhibits exponential behaviour. Not sure offhand (it's late!) if it can be transformed to anything simpler. Regards, Toby. _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
