This deduction system can easily be converted into a parsing schema by associating adequate semantics with items.
we do not show this here for space reasons, because we would first have to explain the formalism of regular dependency grammars.