We also note that similar to arc-eager transitions, arc-swift transitions must also satisfy certain pre-conditions.
an RArc[k] transition requires that the top k − 1 elements in the stack are already attached; LArc[k] additionally requires that the k-th element is unattached, resulting in no more than one feasible LArc candidate for any parser state.