Optimal Expression Motion: The Multiple-Expression View

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1539)


In this chapter we demonstrate how the results of Chapter 3 can be profitably used for the development of algorithms that are able to cope with a set of program expressions simultaneously. The extension is almost straightforward if the universe of program expressions is flat, i. e. only contains expressions which are independent in terms of the subexpression relation. This, for instance, holds for intermediate level programs whose expressions are completely decomposed into three-address format. However, decomposing large expressions comes at the price of weakening the potential for expression motion, as such process introduces a bunch of new modification sites.


Bipartite Graph Insertion Point Program Point Computational Optimality Initialisation Candidate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Personalised recommendations