The list λ 1 has its head to the right and stores nodes in descending order, and the list λ 2 has its head to the left and stores nodes in ascending order.
we have defined four different transition systems for incremental dependency parsing, proven their correctness for different classes of dependency graphs, and analyzed their time and space complexity under the assumption that there exists a constant-time oracle for predicting the next transition.