4 ms·
is the performance of the PEG parser really comparable to that of LL(1)? PEG would do a whole lot more backtracking.
by MichaelMoser123 6y ago
is the performance of the PEG parser really comparable to that of LL(1)? PEG would do a whole lot more backtracking.
- pansa2 6y agoPython's LL(1) parser isn't particularly fast. It's not a recursive-descent parser custom-made for Python's grammar, but a data-driven general-purpose design. What's more, it's not driven by a simple LL(1) table but by more complex data: a set of DFAs.