|Constant expression evaluation? mdhe51ATdialDOTpipexDOTcom@eu.uu.net (Paul Davis) (2003-05-14)|
|Re: Constant expression evaluation? firstname.lastname@example.org (Christian Bau) (2003-05-16)|
|Re: Constant expression evaluation? email@example.com (Dierk Ohlerich) (2003-05-16)|
|Re: Constant expression evaluation? firstname.lastname@example.org (Clint Olsen) (2003-05-18)|
|Re: Constant expression evaluation? email@example.com (Niksa Orlic) (2003-05-29)|
|Re: Constant expression evaluation? firstname.lastname@example.org (david lindauer) (2003-05-29)|
|From:||Niksa Orlic <email@example.com>|
|Date:||29 May 2003 03:21:51 -0400|
|Posted-Date:||29 May 2003 03:21:51 EDT|
A year ago I wrote a compiler (part of my student project) with
constant expression evaluation. My compiler generated intermediate
code in postfix notation; that postfix code was then optimized and
Java bytecode was generated from the intermediate code.
As I understand, your compiler generates some sort of postfix
code. The idea is to run this code through the optimizer after it is
created, the optimizer will then produce optimized code.
I'll email you the algorithm of the optimizer, if anyone else here is
interested in it, contact me by email for the algorithm.
Return to the
Search the comp.compilers archives again.