|Optimal emission of DAGS email@example.com (1997-02-02)|
|Re: Optimal emission of DAGS firstname.lastname@example.org (1997-02-03)|
|From:||email@example.com (Hasdi Rodzmann Hashim)|
|Date:||2 Feb 1997 21:29:45 -0500|
|Organization:||University of Michigan|
I am looking for something similar to Sethi-Ullman method of emitting
expression. In Sethi-Ullman method, you can emit an expression in the
order that would use the least number of resources. This assumes that
the expression is in a form of a tree. Is there a way to do something
similar if the expression is in a form of a directed acyclic graph?
Return to the
Search the comp.compilers archives again.