This item represents a set of computations (transition sequences) that start from a configuration of the form pσ, i|β, Aq (where σ is the stack and i|β is the buffer, with i being the first buffer node) and take the parser to a configuration of the form pσ|i, j|β 1 , Aq.
the computation has the net effect of placing node i on top of the previous contents of the stack, and it ends in a state where the first buffer element is j.