To see this, let us assume that some connector vertex of G i is found inside the tree below a i .
we then replace each edge in M with a vertex in D, and replace each vertex in M with a clique in D. D is the dependency graph for an SCFG rule, because it has a vertex for each boundary, and a clique that connects the boundaries of each nonterminal (including the left-hand side nonterminal).