Generalizations of the sethi‐ullman algorithm for register allocation
Andrew W. Appel, Kenneth J. Supowit · Software Practice and Experience · 1987
Abstract 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.