International Conference on Compiler Construction

CC 2013: Compiler Construction pp 102-122

Simple and Efficient Construction of Static Single Assignment Form

  • Matthias Braun
  • Sebastian Buchwald
  • Sebastian Hack
  • Roland Leißa
  • Christoph Mallon
  • Andreas Zwinkau
Conference paper

DOI: 10.1007/978-3-642-37051-9_6

Volume 7791 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Braun M., Buchwald S., Hack S., Leißa R., Mallon C., Zwinkau A. (2013) Simple and Efficient Construction of Static Single Assignment Form. In: Jhala R., De Bosschere K. (eds) Compiler Construction. CC 2013. Lecture Notes in Computer Science, vol 7791. Springer, Berlin, Heidelberg

Abstract

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Matthias Braun
    • 1
  • Sebastian Buchwald
    • 1
  • Sebastian Hack
    • 2
  • Roland Leißa
    • 2
  • Christoph Mallon
    • 2
  • Andreas Zwinkau
    • 1
  1. 1.Karlsruhe Institute of TechnologyGermany
  2. 2.Saarland UniversityGermany