I can find the strict dominators of basic blocks in a control flow graph, but I don't understand how to reduce the strict dominators to immediate dominators.<BR><BR>wikipedia has the following ...

Control flow is one of the simplest and most expressive representations of a program. Control flow is often represented as a control flow graph which contains an edge from statement A to B when there ...