Reverse postordering produces a topological sorting of any directed acyclic graph. This ordering is also useful in control-flow analysis as it often represents a natural linearization of the control flows. The graph above might represent the flow of control in the code fragment below, and it is natural to consider this code in the order A B C D or A C B D but not natural to use the order A B D C or A C D B.
reverse postordering produces a topological sorting of any directed acyclic graph this ordering is also useful in control-flow analysis as it often represents a natural linearization of the control flows the graph above might represent the flow of control in the code fragment below and it is natural to consider this code in the order a b c d or a c b d but not natural to use the order a b d c or a c d b