Python'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. W

Python'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.