29 Nov 2005 16:10:45 -0500

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: | Martin Ward <martin@gkc.org.uk> |

Newsgroups: | comp.compilers |

Date: | 29 Nov 2005 16:10:45 -0500 |

Organization: | Compilers Central |

References: | 05-11-117 |

Keywords: | analysis |

Posted-Date: | 29 Nov 2005 16:10:45 EST |

I have implemented the dominators algorithm from "Dominators in Linear Time",

by S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup (SIAM J. Comput.,

28(6):2117--2132, June 1999) in a perl module as part of

the FermaT program transformation system.

FermaT can be downloaded from:

http://www.cse.dmu.ac.uk/~mward/fermat.html

http://www.dur.ac.uk/martin.ward/fermat.html

The implementation is the function calculate_dom in the file

fermat3/config/Blocks.pm

--

Martin

martin@gkc.org.uk http://www.cse.dmu.ac.uk/~mward/ Erdos number: 4

G.K.Chesterton web site: http://www.cse.dmu.ac.uk/~mward/gkc/

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.