This is why we restrict ourself to the class of PD-grammars which have such a property.
we fix finite alphabets of terminals (words), of nonterminals (syntactic types or classes), and  In distinction to (Dikovsky, 2001), the nonterminals (and even dependency names) can be structured.