, n from B to Σ (using SHIFT) and then remove them from Σ (using LEFT-ARC l or RIGHT-ARC l ), which will produce a tree with root 0.
the system of Nivre (2008b) is sound but not complete for the class of all dependency trees.