For every internal node in the parse tree, traversed top-down, the node is matched against the conditioning context, and if a match is found, the associated action applies.
we pretend to consider two nodes, one with the first set of children, and one with the second, proceeding left to right.