Static Transition Compression

Daniel Damian and Olivier Danvy

To appear at Workshop on the Semantics, Applications, and Implementation of Program Generation (SAIG01), Firenze, Italy, 6 September 2001


Abstract

We specify operationally a translation from a structured to an unstructured imperative language, we point out how a compositional specification gives rise to static chains of jumps, and, taking an inspiration from the notion of continuation, we state a new compositional specification that provably does not give rise to static chains of jumps, redundant labels, and unused labels. In SSA terms, this transformation yields a reduced number of phi-nodes for conditional commands.


Server START Conference Manager
Update Time 16 Jun 2001 at 14:22:38
Maintainer saig@cs.yale.edu.
Start Conference Manager
Conference Systems