2 Feb 1997 21:29:45 -0500

Related articles |
---|

Optimal emission of DAGS hasdi@umich.edu (1997-02-02) |

Re: Optimal emission of DAGS anton@a0.complang.tuwien.ac.at (1997-02-03) |

From: | hasdi@umich.edu (Hasdi Rodzmann Hashim) |

Newsgroups: | comp.compilers |

Date: | 2 Feb 1997 21:29:45 -0500 |

Organization: | University of Michigan |

Keywords: | tools, optimize |

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?

Thanks

Hasdi

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.