In our case, the input is a shallow graph instead of a syntactic tree, and hence the search space is larger.
the same set of actions can still be applied, with additional constraints on valid actions given each configuration (Section 3.2.3).