|non recursive algorithm for depth first numbering firstname.lastname@example.org (Jeremy Wright) (2001-12-03)|
|Re: non recursive algorithm for depth first numbering email@example.com (2001-12-07)|
|From:||Jeremy Wright <firstname.lastname@example.org>|
|Date:||3 Dec 2001 20:25:39 -0500|
|Keywords:||optimize, analysis, question|
|Posted-Date:||03 Dec 2001 20:25:38 EST|
Is there a non recursive algorithm to do depth first numbering, or
optimizations to the standard algorithm (as in Dragon 2, pp 662) that
reduce the amount of recursion.
The issue arises as I am processing the basic block graph for a
perform range in Cobol. The graph can be extremely big. Additionally,
perform statements occur in a basic block by themselves (to allow
optimizations across performs, and into/out of perform ranges). This
causes the depth of the graph to be orders of magnitude greater than
would otherwise be the case.
Return to the
Search the comp.compilers archives again.