During the first iteration, we start at the root of the tree, and greedily parse until we reach a leaf.
for each node, we use the Stack-LSTM model to calculate scores for each transition (as described in Section 2), and then execute the highest-scoring transition, generating a child node upon which we repeat the procedure.