Since computing the hierarchy between tree nodes is very fast, and then testing whether a state is still active is just one operation, the result is a simple, basically linear algorithm that does not need compilation to quickly determine which transitions to take.