Re:A question about Dominators

"kvinay" <kvinay@ip.eth.net>
20 Dec 2001 00:05:27 -0500

          From comp.compilers

Related articles
A question about Dominators rsherry8@home.com (Robert Sherry) (2001-12-15)
Re:A question about Dominators kvinay@ip.eth.net (kvinay) (2001-12-20)
Re: A question about Dominators vbdis@aol.com (2001-12-20)
Re: A question about Dominators Martin.Ward@durham.ac.uk (2001-12-20)
Re: A question about Dominators sweeks@acm.org (2001-12-20)
Re: A question about Dominators jeremy.wright@merant.com (Jeremy Wright) (2001-12-20)
| List of all articles for this month |

From: "kvinay" <kvinay@ip.eth.net>
Newsgroups: comp.compilers
Date: 20 Dec 2001 00:05:27 -0500
Organization: Compilers Central
References: 01-12-067
Keywords: analysis, books
Posted-Date: 20 Dec 2001 00:05:27 EST

Hi,


In the example flow graph given by you, node 'a' certainly dominates node 'b',
as start node dominates all other nodes, according to the definition of dominators
given in the dragon book.


According to the excerpt from Advanced Compiler Design Implementation, Muchnick
given in your mail, we can say that:


(1) Node 'e' dominates node 'b', as 'e' is unique immediate predecessor of 'b'.


(2) Node 'c' dominates node 'e', as 'c' is unique immediate predecessor of 'e'


(3) Node 'a' dominates node 'c', as 'a' is unique immediate predecessor of 'c'




As the dominance relationship is transitive, we can say that node 'a' dominates
'b'.


Thanks and Regards,
-Vinay Kakade.



Post a followup to this message

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