Table 1.

Sequence of state transitions of the versatile shift processing the well-formed string from example 2, i.e. NP V NP. The operations are indicated as follows: “predict (X)” means prediction according to rule (X) of the context-free grammar; attach means cancelation of successfully predicted terminals both from stack and input; and “accept” means acceptance of the string as being well-formed

Time	State	Operation
0	S.NP V NP	Predict (26)
1	VP NP.NP V NP	Attach
2	VP.V NP	Predict (27)
3	NP V.V NP	Attach
4	NP.NP	Attach
5	$ϵ$.$ϵ$	Accept