Essentially, given a state s = ([σ|j i], ρ, A) and an input graph C, the Decoder extracts syntactic tree from the graph (cf.
if node i has direct child nodes in C, the descendants of i are shifted (line 6-7) (see Algorithm 3).