5 Mar 1998 23:20:58 -0500

Related articles |
---|

dominator tree lkaplan@mips.complang.tuwien.ac.at (1998-03-05) |

Re: dominator trees clc5q@cs.virginia.edu (Clark L. Coleman) (1998-03-07) |

Re: dominator tree mwolfe@pgroup.com (1998-03-07) |

Re: dominator tree chase@naturalbridge.com (David Chase) (1998-03-07) |

Re: dominator tree jason@reflections.com.au (1998-03-08) |

Re: dominator tree awaters@acm.org (1998-03-12) |

Re: dominator tree sreedhar@cup.hp.com (Vugranam Sreedhar) (1998-03-12) |

[5 later articles] |

From: | lkaplan@mips.complang.tuwien.ac.at (Aaron Leon Kaplan) |

Newsgroups: | comp.compilers |

Date: | 5 Mar 1998 23:20:58 -0500 |

Organization: | Vienna University of Technology, Austria |

Keywords: | theory, analysis, question |

Hi!

Has anyone implemented the dominator tree algorithm by Dov Harel

(idescribed in the paper "A linear time algorithm for finding dominators

in a flow graph and related problems")? I would be very interested in the

exchange of ideas.

Or: Is there a "proper" paper describing this algorithm? All I have is an

extended abstract, which does not seem to be very helpfull in its rather

brief description of the algorithm (i.e. many important steps are left out)?

If so where did it appear?

Thx,

Aaron.

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.