Intuitively, recursive ascent is a literal implementation of the LR parsing concept.
There is also a third LR automaton action which may be taken in a given state, but only after a reduce where the shift counter has decremented to zero (indicating that the current state should handle the result).