Related articles |
---|
Native Code Generation from Abstract Stack Machine kevin@albrecht.net (Kevin Albrecht) (2004-02-27) |
Re: Native Code Generation from Abstract Stack Machine alex_mcd@btopenworld.com (Alex McDonald) (2004-03-02) |
Re: Native Code Generation from Abstract Stack Machine m.dentico@no-spam.it (Massimo Dentico) (2004-03-02) |
Re: Native Code Generation from Abstract Stack Machine bill@qswtools.com (Bill Cox) (2004-03-06) |
Re: Native Code Generation from Abstract Stack Machine peter@javamonkey.com (Peter Seibel) (2004-03-06) |
Re: Native Code Generation from Abstract Stack Machine peter@javamonkey.com (Peter Seibel) (2004-03-11) |
Re: Native Code Generation from Abstract Stack Machine samiam@moorecad.com (Scott Moore) (2004-03-11) |
[2 later articles] |
From: | "Kevin Albrecht" <kevin@albrecht.net> |
Newsgroups: | comp.compilers |
Date: | 27 Feb 2004 22:18:10 -0500 |
Organization: | RoadRunner - Tampa Bay |
Keywords: | optimize |
Posted-Date: | 27 Feb 2004 22:18:10 EST |
I am looking for research or implementations on how to generate
efficient machine code from abstract stack machines. It seems like
most resources on machine code generation from intermediate languages
focuses on translation from register-based intermediate languages.
-- Kevin
[I suspect the advice is turn it into abstract register code, then
optimize. Optimizing stack code is a pain because of all of the
bookkeeping you have to do for common subexpressions. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.