For example, in Figure 1, for the input sentence w 0 w 1 w 2 and its POS tags abc, our parser can construct two parse trees using action sequences given below these trees.
parse trees in Treebanks often contain an arbitrary number of branches.