Given these equivalence classes, we define the matrix grammar The rules R m of G m are then designed to enforce the above mentioned tree well formedness constraints.
some possible such rules are given in Table 1 using ID/LP notation (Gazdar et al., 1985).an immediate dominance rule of the form a → b , c is expanded as two rules a → b c and a → c b.