Previous Next |
18.1
Calculate the dominators of each node of this Flowgraph:
The graph of Image 2.8.
Show a graph with nodes d, e, and n such that d dominates n, e dominates n, but neither d dominates e nor e dominates d.
is "off by one." Rewrite this criterion for the case where the bounds-check comparison occurs before the loop-exit test.
JaVa | Previous Next |