If we take the $100 example, the canonical transition sequence is SHIFT, SHIFT, SHIFT, REDUCE S, SHIFT, REDUCE S, REDUCE I, and the corresponding cannonical parse is $ [ [ 1 0 ] 0 ] .
given w 0 , ..., w n−1 and P , the learning problem is mapping from w 0 , ...w n−1 to the canonical transition TRANSITION(P ).