|Reducible flow graphs firstname.lastname@example.org (Domagoj Babic) (2006-02-24)|
|From:||Domagoj Babic <email@example.com>|
|Date:||24 Feb 2006 18:03:36 -0500|
|Organization:||Department of Computer Science, UBC|
|Posted-Date:||24 Feb 2006 18:03:36 EST|
My SSA-based analysis would require a reducible flow graph, but instead of
converting irreducible graphs to reducible at the front end (like in
http://www.sable.mcgill.ca/~hendren/ftp/papers/ICCL94.ps.gz), I'd like to do
the conversion directly on SSA.
I really like the simplicity of Erosa and Hendren's method... Has anyone
attempted to design an equivalent algorithm for SSA?
Return to the
Search the comp.compilers archives again.