|Post-dominance relation in CFGs with no exit email@example.com (Dmitry Shaporenkov) (2001-03-26)|
|Re: Post-dominance relation in CFGs with no exit firstname.lastname@example.org (Bob Morgan) (2001-03-27)|
|From:||Dmitry Shaporenkov <email@example.com>|
|Date:||26 Mar 2001 13:50:36 -0500|
|Posted-Date:||26 Mar 2001 13:50:36 EST|
Does anybody know the proper way to
apply algorithms for computation of post-dominators
to flowgraphs without exit node? Obviously, it is necessary to
augment CFG with the fake exit node, but how to determine what
nodes of CFG connect with it?
Return to the
Search the comp.compilers archives again.