1 looks as follows: This grammar accepts all trees over Σ except ones in which a node with label 2 is the parent of a node with label 1, because such trees correspond to configurations in which a node with label a z is the parent of a node with label a x , a z and a x are permutable, and 2 > 1.
it will accept the configurations (b), (c), and (e) in Fig.