 The fastest parsers use generated assembler code.In the recursive ascent parser variation, the explicit parse stack structure is also replaced by the implicit stack used by subroutine calls.Reductions terminate several levels of subroutine calls, which is clumsy in most languages.