 So recursive ascent parsers are generally slower, less obvious, and harder to hand-modify than recursive descent parsers.Another variation replaces the parse table by pattern-matching rules in non-procedural languages such as Prolog.GLR Generalized LR parsers use LR bottom-up techniques to find all possible parses of input text, not just one correct parse.