We have already argued that this tree can be induced by a TAG.
it contains no two adjacent nodes that are connected by a/a b\a a/a b\b a b\b 1 2 3 4 Figure 8: The divergence between CCG and TAG an edge; and every nontrivial PF-CCG derivation must combine two adjacent words at least at one point during the derivation.