Answers are grounded in this paper and cite their sources.
We provide a set of transformations capable of transforming a straight line program into any other equivalent one assuming no algebraic laws hold. We then show that optimization of straight line code under “reasonable” cost criteria can always be accomplished by applying sequences of these transformations in a prescribed order.
No takes yet. Share an insight, caveat, or question.
Aho et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: