Compiler Construction

Volume 7791 of the series Lecture Notes in Computer Science pp 102-122

Simple and Efficient Construction of Static Single Assignment Form

  • Matthias BraunAffiliated withKarlsruhe Institute of Technology
  • , Sebastian BuchwaldAffiliated withKarlsruhe Institute of Technology
  • , Sebastian HackAffiliated withSaarland University
  • , Roland LeißaAffiliated withSaarland University
  • , Christoph MallonAffiliated withSaarland University
  • , Andreas ZwinkauAffiliated withKarlsruhe Institute of Technology

* Final gross prices may vary according to local VAT.

Get Access


We present a simple SSA construction algorithm, which allows direct translation from an abstract syntax tree or bytecode into an SSA-based intermediate representation. The algorithm requires no prior analysis and ensures that even during construction the intermediate representation is in SSA form. This allows the application of SSA-based optimizations during construction. After completion, the intermediate representation is in minimal and pruned SSA form. In spite of its simplicity, the runtime of our algorithm is on par with Cytron et al.’s algorithm.