If the stack contains exactly one word, we terminate and output a tree, which was true also in the old system.
if the stack contains more than one word, we now go on parsing but are forbidden to make any Shift transitions.