 And that is indeed its job!How can a mere FSM do this when the original unparsed language has nesting and recursion and definitely requires an analyzer with a stack?The trick is that everything to the left of the stack top has already been fully reduced.