Straight line programs are essentially sequences of assignment statements. A general program consists of straight line segments with flow of control between these segments. The interfaces between a straight line segment and the rest of the program place constraints on register allocations for the segment. These constraints may render a register allocation for a straight line program unrealizable. An algorithm is given to determine if a register allocation for a straight line program is realizable. It is shown that the algorithm takes O(n3) steps, where n is the number of statements in the program. An unrealizable assignment may be made realizable by introducing stores into memory at appropriate points. It is shown how the minimum number of such stores may be found.
|Original language||English (US)|
|Number of pages||16|
|Journal||Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - May 1 1972|
|Event||4th Annual ACM Symposium on Theory of Computing, STOC 1972 - Denver, United States|
Duration: May 1 1972 → May 3 1972
ASJC Scopus subject areas