Assuming an input sentence contains n words, in order to reach a terminal state, the initial state requires n sh-x actions to consume all words in β, and n − 1 rl/rr-x actions to construct a complete parse tree by consuming all the subtrees in σ.
ru-x is a very special action.