Sorry, I was referring to *ambiguous* grammar rules. Extract of the PEP:
"Unlike LL(1) parsers PEG-based parsers cannot be ambiguous: if a string parses, it has exactly one valid parse tree. This means that a PEG-based parser cannot suffer from the ambiguity problems described in the previous section."
Le ven. 3 avr. 2020 à 02:58, Greg Ewing firstname.lastname@example.org a écrit :
On 3/04/20 10:33 am, Victor Stinner wrote:
I also like the fact that PEG is deterministic, whereas LL(1) parsers are not.
Where do you get that LL(1) parsers are not deterministic? That's news to me!
-- Greg _______________________________________________ Python-Dev mailing list -- email@example.com To unsubscribe send an email to firstname.lastname@example.org https://mail.python.org/mailman3/lists/python-dev.python.org/ Message archived at https://email@example.com/message/JHHLCUF7... Code of Conduct: http://python.org/psf/codeofconduct/