Linear-time algorithm to determine the maximum number of iterations of the iterative algorithm for data-flow analysis for reducible loops

The method of claim 6, wherein:

• said step of transmitting the machine readable language program to a computer of the target computer type includes
• storing the machine readable language program on a non-transitory and non-volatile media carrier,
• conveying the media carrier to the computer of the target computer type, and
• recalling the machine readable language program from the media carrier.

A tangible, non-transitory and non-volatile data storage media storing instructions controlling a general purpose computer to compile a human readable high level language program into a machine readable language program of a target computer type, said controlling including:

• forming an initial control-flow graph of the program in the human readable language program having nodes, including a starting node, and edges;
• iteratively
• for each node having a backedge into a current starting node, collapsing the control-flow graph including all nodes between the node having the backedge into the current starting node and the current starting node into a new starting node,
• counting each collapse,
• until only a single node remains in the control-flow graph;
• performing data-flow analysis over the initial control flow graph iterating one more than a number of times equal to the number of counted collapses;
• and
• generating a machine readable language program corresponding to said human readable high level language program based upon the data-flow analysis.