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.

Conferences

• Simple and Efficient Construction of Static Single Assignment Form - CC 2013
  Braun, M., Buchwald, S., Hack, S., Leißa, R., Mallon, C. and Zwinkau, A.
  Compiler Construction, pages 102-122, Springer Berlin Heidelberg, 2013. [doi] [url] [pdf] [bib]
  

  @conference{BBHLMZ:2013:ssa,
     title = {{S}imple and {E}fficient {C}onstruction of {S}tatic {S}ingle {A}ssignment {F}orm},
     booktitle = {Compiler Construction},
     booktitle_short = {CC},
     year = {2013},
     publisher = {Springer Berlin Heidelberg},
     volume = {7791},
     pages = {102-122},
     author = {Matthias Braun and Sebastian Buchwald and Sebastian Hack and Roland Lei{\ss}a and Christoph Mallon and Andreas Zwinkau},
     editor = {Jhala, Ranjit and Bosschere, Koen},
     series = {Lecture Notes in Computer Science},
     url = {http://www.cdl.uni-saarland.de/projects/ssaconstr},
     webpdf = {http://www.cdl.uni-saarland.de/papers/bbhlmz13cc.pdf},
     doi = {10.1007/978-3-642-37051-9_6},
   }

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

• clang: a C language family frontend for LLVM
• The LLVM Compiler Infrastructure
• Our patches to clang available in our Redmine repository
• Our patches to LLVM available in our Redmine repository
• Programming paradigms group - IPD Snelting at the Karlsruhe Institute of Technology
• libFirm: A C compiler using our technique