In our proposed tree description language, we provide for underspecified dominance but not for underspecified linear precedence.
in the graphical representations of d-trees, we assume that sister nodes are always ordered as shown.