Simple and efficient construction of static single assignment form
| Autor: | Christoph Mallon, Sebastian Hack, Sebastian Buchwald, Roland Leißa, Matthias Braun, Andreas Zwinkau |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Intermediate language
Static single assignment form media_common.quotation_subject 020207 software engineering 0102 computer and information sciences 02 engineering and technology Translation (geometry) Quantitative Biology::Genomics Computer Science::Numerical Analysis 01 natural sciences Physics::Geophysics Quantitative Biology::Quantitative Methods Bytecode 010201 computation theory & mathematics Simple (abstract algebra) TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Basic block 0202 electrical engineering electronic engineering information engineering Statistics::Methodology Simplicity Software_PROGRAMMINGLANGUAGES Abstract syntax tree Algorithm Mathematics media_common |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783642370502 CC |
| DOI: | 10.1007/978-3-642-37051-9_6 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|