In this section, we show how this formulation can also be used to define a novel algorithm.
we can obtain a transition system that will be able to parse any planar dependency graph (regardless of projectivity) if we use all elementary transitions except UNSHIFT directly as the transitions of the system.