Programs with Minimal Goto Statements

An algorithm is presented which produces a program with the minimum number of goto statements. We can apply the algorithm not only to an arbitrary loop free flowgraph but also to the class of “gate flowgraph” in which all entries and exits are particular for every cycle of the flowgraph. The algorithm has an O ( n ) time bound where n is the number of nodes in the flowgraph. Every flowgraph can be trivially transformed into a gate flowgraph.