In a control-flow graph each node in the graph represents a basic block, i.e. a straight-line sequence of code with a … See more

Consider the following fragment of code:
In the above, we have 4 basic blocks: A from 0 to 1, B from 2 to 3, C at 4 and D at 5. In particular, in this case, A is the "entry block", D the "exit block" and lines 4 and 5 are jump ta… See more

Reachability is a graph property useful in optimization.
If a subgraph is not connected from the subgraph containing the entry block, that subgraph is unreachable during any execution, … See more