Many language classes are closed under intersection with a regular set, and the result of the intersection of a language L(G) with a regular language α is describable as a specialization G α of G that assigns to all and only the strings in α effectively the same parse trees as G would assign.
the rules in (26a) result from reducing the licensing rules of the derivation in Figure 4 with the reducing substitution (20).