Post-dominance relation in CFGs with no exit

Dmitry Shaporenkov <dsha@post.tepkom.ru>
26 Mar 2001 13:50:36 -0500

          From comp.compilers
Related articles
Post-dominance relation in CFGs with no exit dsha@post.tepkom.ru (Dmitry Shaporenkov) (2001-03-26)
Re: Post-dominance relation in CFGs with no exit crmorgan@venus.star.net (Bob Morgan) (2001-03-27)
| List of all articles for this month |
From: Dmitry Shaporenkov <dsha@post.tepkom.ru>
Newsgroups: comp.compilers
Date: 26 Mar 2001 13:50:36 -0500
Organization: Compilers Central
Keywords: analysis, question
Posted-Date: 26 Mar 2001 13:50:36 EST

Hello,
            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?


Thanks.




                                                                                  Regards,
                                                                                  Dmitry Shaporenkov

Post a followup to this message

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