Algorithm 3: GETPOSSIBLEACTIONS for full tree linearization, where C is a full tree Input: A state s = ([σ|j i], ρ, A) and gold tree C Output: A set of possible transition actions Algorithm 2 can also be used with full-tree constraints, which are a special case of partial-tree constraints.
there is a conceptually simpler algorithm that leverages full-tree constraints.