¶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.

¶BiBTex

@InProceedings{10.1007/978-3-642-37051-9_6,
author="Braun, Matthias
and Buchwald, Sebastian
and Hack, Sebastian
and Lei{\ss}a, Roland
and Mallon, Christoph
and Zwinkau, Andreas",
editor="Jhala, Ranjit
and De Bosschere, Koen",
title="Simple and Efficient Construction of Static Single Assignment Form",
booktitle="Compiler Construction",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="102--122",
isbn="978-3-642-37051-9"
}