Single-Pass Generation of Static Single Assignment Form for Structured Languages

Marc Michael Brandis; Hanspeter Mössenböck

doi:10.1145/197320.197331

Single-Pass Generation of Static Single Assignment Form for Structured Languages

Marc Michael Brandis, Hanspeter Mössenböck

Institute for Systems Software

Research output: Contribution to journal › Article › peer-review

Abstract

Over the last few years, static single assignment (SSA) form has been established as a suitable intermediate program representation that allows new powerful optimizations and simplifies others considerably. Algorithms are known that generate SSA form from programs with an arbitrary flow of control. These algorithms need several passes. We show that it is possible to generate SSA form in a single pass (even during parsing) if the program contains only structured control flow (i.e., no gotos). For such programs the dominator tree can be built on the fly, too.

Original language	English
Journal	ACM Transactions on Programming Languages and Systems
DOIs	https://doi.org/10.1145/197320.197331
Publication status	Published - Nov 1994

Fields of science

102 Computer Sciences
102009 Computer simulation
102011 Formal languages
102013 Human-computer interaction
102029 Practical computer science
102022 Software development
102024 Usability research

Access to Document

10.1145/197320.197331

Cite this

@article{8fd74dcd4b5e4627aa1aaebf163bf4a1,

title = "Single-Pass Generation of Static Single Assignment Form for Structured Languages",

abstract = "Over the last few years, static single assignment (SSA) form has been established as a suitable intermediate program representation that allows new powerful optimizations and simplifies others considerably. Algorithms are known that generate SSA form from programs with an arbitrary flow of control. These algorithms need several passes. We show that it is possible to generate SSA form in a single pass (even during parsing) if the program contains only structured control flow (i.e., no gotos). For such programs the dominator tree can be built on the fly, too.",

author = "Brandis, {Marc Michael} and Hanspeter M{\"o}ssenb{\"o}ck",

year = "1994",

month = nov,

doi = "10.1145/197320.197331",

language = "English",

journal = "ACM Transactions on Programming Languages and Systems",

}

TY - JOUR

T1 - Single-Pass Generation of Static Single Assignment Form for Structured Languages

AU - Brandis, Marc Michael

AU - Mössenböck, Hanspeter

PY - 1994/11

Y1 - 1994/11

N2 - Over the last few years, static single assignment (SSA) form has been established as a suitable intermediate program representation that allows new powerful optimizations and simplifies others considerably. Algorithms are known that generate SSA form from programs with an arbitrary flow of control. These algorithms need several passes. We show that it is possible to generate SSA form in a single pass (even during parsing) if the program contains only structured control flow (i.e., no gotos). For such programs the dominator tree can be built on the fly, too.

AB - Over the last few years, static single assignment (SSA) form has been established as a suitable intermediate program representation that allows new powerful optimizations and simplifies others considerably. Algorithms are known that generate SSA form from programs with an arbitrary flow of control. These algorithms need several passes. We show that it is possible to generate SSA form in a single pass (even during parsing) if the program contains only structured control flow (i.e., no gotos). For such programs the dominator tree can be built on the fly, too.

UR - http://www.ssw.uni-linz.ac.at/Papers/SSA.ps.Z

U2 - 10.1145/197320.197331

DO - 10.1145/197320.197331

M3 - Article

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

ER -

Single-Pass Generation of Static Single Assignment Form for Structured Languages

Abstract

Fields of science

Access to Document

Other files and links

Cite this