Implementation of SSA

Juergen Vollmer <vollmer@ipd.info.uni-karlsruhe.de>
Mon, 27 Mar 1995 17:46:53 GMT

          From comp.compilers
Related articles
Implementation of SSA vollmer@ipd.info.uni-karlsruhe.de (Juergen Vollmer) (1995-03-27)
| List of all articles for this month |
Newsgroups: comp.compilers
From: Juergen Vollmer <vollmer@ipd.info.uni-karlsruhe.de>
X-Organization: Universitaet Karlsruhe, Institut fuer Programm- und Datenstrukturen Vincenz-Priessnitz-Strasse 3 D-76128 Karlsruhe
Keywords: question, analysis
Organization: Compilers Central
Date: Mon, 27 Mar 1995 17:46:53 GMT

I'm writing an optimizer for Modula-2 (or more accurate for its
parallel extension Modula-P) and want it to be based on SSA (static
single assignment form). I started with the algorithm of Cytron,
Ferrante, Rosen and Wegman presented in TOPLAS 4/91.


Now I'm looking for information about how to handle (i.e. implement):
- procedure calls
- alias information
- nested procedures
- pointers
- VAR (call by reference) parameters


Any response is appreciated. Please email me, I'll summarize.


Juergen Vollmer
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.