Related articles |
---|
[17 earlier articles] |
Re: Intermediate Representation marti@antares.inf.ethz.ch (1990-08-13) |
Re: Intermediate Representation muller@procope.pa.dec.com (Eric Muller) (1990-08-14) |
Re: Intermediate Representation pd@complex.Eng.Sun.COM (1990-08-15) |
Re: Intermediate Representation staff@cadlab.sublink.org (1990-08-18) |
Re: Intermediate Representation ok@goanna.cs.rmit.OZ.AU (1990-08-20) |
intermediate representation han@cs.rochester.edu (1991-02-20) |
Re: intermediate representation lavinus@csgrad.cs.vt.edu (1991-02-22) |
Re: intermediate representation mike@vlsivie.tuwien.ac.at (1991-02-23) |
Re: intermediate representation rfg@ncd.com (1991-02-26) |
Re: intermediate representation megatest!djones@decwrl.dec.com (1991-02-27) |
Re: intermediate representation tarvydas@turing.toronto.edu (1991-03-04) |
Newsgroups: | comp.compilers |
From: | lavinus@csgrad.cs.vt.edu |
Keywords: | question, optimize, design, analysis |
Organization: | Virginia Tech Computer Science, Blacksburg, VA |
References: | <9102210223.AA15327@cyan.cs.rochester.edu> |
Date: | 22 Feb 91 20:42:11 GMT |
Hi!
In answer to both your questions, I hope: ideally, intermediate
representations should not be at all machine dependent (beyond the fact that
they might be dependent on, say, the Von Neumann architecture). When I think
of intermediate code, I think of something along the lines of P-code (by
Wirth), which is a sort of machine code for a simple, hypothetical,
stack-based machine, and is quite generic and non-machine-dependent. That
might be a good one for your purposes. By the way, could you (or a
colleague) suggest a good book or reference on such back-end compiler
optimization?
Thanks and good luck...
Joe Lavinus
--
Joseph W. Lavinus
Virginia Tech, Blacksburg, Virginia
email: lavinus@csgrad.cs.vt.edu
[I suspect that after you read all about compiler optimization you'll be more
sympathetic to machine dependent intermediate code. -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.