The analysis method that will be presented here is logically equivalent to the parsing of a dependency grammar with no locality constraints.
the complexity of a fully recursive parsing method grows more than exponentially with the length of the input.