Related articles |
---|
Algorithm for finding dominators in a control flow graph marouane.tlili@gmail.com (2005-11-26) |
Re: Algorithm for finding dominators in a control flow graph jeffrey.kenton@comcast.net (Jeff Kenton) (2005-11-27) |
Re: Algorithm for finding dominators in a control flow graph nmm1@cus.cam.ac.uk (2005-11-29) |
Re: Algorithm for finding dominators in a control flow graph martin@gkc.org.uk (Martin Ward) (2005-11-29) |
Re: Algorithm for finding dominators in a control flow graph neal.wang@gmail.com (2005-12-08) |
From: | Jeff Kenton <jeffrey.kenton@comcast.net> |
Newsgroups: | comp.compilers |
Date: | 27 Nov 2005 00:35:58 -0500 |
Organization: | Compilers Central |
References: | 05-11-117 |
Keywords: | analysis |
Posted-Date: | 27 Nov 2005 00:35:58 EST |
The algorithm is in the article (and in Keith Cooper's book). It
won't take you more than a page of code, and if you do it yourself
you'll understand it too.
marouane.tlili@gmail.com wrote:
> I would like to know , if possible , if anyone hearded about an
> implementation or API (java would be perfect but other languages are
> okay too) of the following algorithm:
>
> A Simple, Fast Dominance Algorithm, by Keith Cooper, Tim Harvey and Ken
> Kennedy.
>
> http://www.cs.rice.edu/~keith/EMBED/dom.pdf
Return to the
comp.compilers page.
Search the
comp.compilers archives again.