Post-Dominators & Lengauer/Targan Algorithm

Rodrigo Augusto Barbato Ferreira <rodrigo.ferreira@dcc.unicamp.br>
1 Apr 2000 14:15:14 -0500

          From comp.compilers
Related articles
Post-Dominators & Lengauer/Targan Algorithm rodrigo.ferreira@dcc.unicamp.br (Rodrigo Augusto Barbato Ferreira) (2000-04-01)
Re: Post-Dominators & Lengauer/Targan Algorithm iank@bearcave.com (Ian Kaplan) (2000-04-03)
| List of all articles for this month |
From: Rodrigo Augusto Barbato Ferreira <rodrigo.ferreira@dcc.unicamp.br>
Newsgroups: comp.compilers
Date: 1 Apr 2000 14:15:14 -0500
Organization: Institute of Computing, University of Campinas, SP, Brazil
Keywords: analysis, question

Hi,


How to compute the postdominance relation using the Lengauer/Tarjan
algorithm for control flow graphs that have no exit. Since a canonical
exit cannot be created for a no exit control flow graph, is there an
alternative to do the reverse depth first ordering of it?


TIA.


Best regards,
Rodrigo Augusto.
--
Rodrigo Augusto B. Ferreira
Computer Science Graduate, UFMG/BRAZIL

Post a followup to this message

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