In this article, we assume that trees are binary, that each node X is annotated with a head h (notation: X[h]), and that the only unary nodes are parents to a terminal.
we only need unary reductions immediately after a SHIFT.