25 Jul 2002 23:20:27 -0400

Related articles |
---|

Finding the set of recursive calls jeremy.wright@microfocus.com (Jeremy Wright) (2002-07-21) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-07-24) |

Re: Finding the set of recursive calls dietz@dls.net (Paul F. Dietz) (2002-07-24) |

Re: Finding the set of recursive calls Martin.Ward@durham.ac.uk (Martin Ward) (2002-07-24) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-07-24) |

Re: Finding the set of recursive calls jeremy.wright@microfocus.com (Jeremy Wright) (2002-07-25) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-07-31) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-08-04) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-08-10) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-08-10) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-08-14) |

From: | "Jeremy Wright" <jeremy.wright@microfocus.com> |

Newsgroups: | comp.compilers |

Date: | 25 Jul 2002 23:20:27 -0400 |

Organization: | Micro Focus |

References: | 02-07-084 |

Keywords: | analysis, optimize |

Posted-Date: | 25 Jul 2002 23:20:27 EDT |

Thanks for the responses.

As a few people have pointed out, what is required is Tarjan's

algorithm for detecting Strongly Connected Components, which is linear

in the number of nodes and edges. Apart from the references in

previous notes, it can also be found on p195 Advanced Compiler Desgin

& Implementation, by Muchnick.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.