On 11/02/2013 05:06 AM, Manfred Nowak wrote:
One prerequisite for every PEG-Parser is, that the language has to be designed to be without any ambiguity.
AFAIK Parser expression grammars handle ambiguity through prioritization.You'd still need to rewrite grammar rules that involve left-recursion or hidden left recursion.
