The Sethi‐Ullman algorithm for register allocation finds an optimal ordering of a computation tree. Two simple generalizations of the algorithm increase its applicability without significantly increasing its cost.
No takes yet. Share an insight, caveat, or question.
Appel et al. (1987) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: