Related articles |
---|
Dominance frontier example in "Engineering a Compiler" rayiner@gmail.com (Rayiner Hashem) (2007-06-19) |
Re: Dominance frontier example in "Engineering a Compiler" klvnraju@gmail.com (Raj) (2007-07-03) |
Re: Dominance frontier example in "Engineering a Compiler" rayiner@gmail.com (Rayiner Hashem) (2007-07-03) |
Re: Dominance frontier example in Engineering a Compiler mstrout@cs.colostate.edu (Michelle Strout) (2007-07-05) |
From: | Raj <klvnraju@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Tue, 03 Jul 2007 15:12:51 -0700 |
Organization: | Compilers Central |
References: | 07-06-040 |
Keywords: | optimize, analysis |
Posted-Date: | 03 Jul 2007 22:10:29 EDT |
B1 cannot be dominance frontier of itself.
See the definition:
A definition at n forces a X-function at m iff
n not DOM(m) but n DOM(p) for some p preds(m)
here, in your case
n=m=B1
and n DOM(m) (according to definition n should not belong to DOM(m))
Return to the
comp.compilers page.
Search the
comp.compilers archives again.