Related articles |
---|
Q: Intermediate code for interpreting & compiling? davis@wln.com (1995-02-10) |
Re: Q: Intermediate code for interpreting & compiling? torbenm@diku.dk (1995-02-14) |
Re: Q: Intermediate code for interpreting & compiling? cef@geodesic.com (Charles Fiterman) (1995-02-14) |
Re: Q: Intermediate code for interpreting & compiling? danhicks@aol.com (1995-02-22) |
Re: Q: Intermediate code for interpreting & compiling? Dave@occl-cam.demon.co.uk (Dave Lloyd) (1995-02-24) |
Re: Q: Intermediate code for interpreting & compiling? zmola@cicero.spc.uchicago.edu (1995-02-24) |
Re: Q: Intermediate code for interpreting & compiling? davidm@Rational.COM (1995-02-28) |
Re: Q: Intermediate code for interpreting & compiling? anton@mips.complang.tuwien.ac.at (1995-03-01) |
Newsgroups: | comp.compilers |
From: | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
Keywords: | interpreter, code, forth |
Organization: | Institut fuer Computersprachen, Technische Universitaet Wien |
References: | 95-02-103 95-02-186 |
Date: | Wed, 1 Mar 1995 12:25:20 GMT |
zmola@cicero.spc.uchicago.edu (Carl Zmola) writes:
|> If you want to get it up and going fast, I would suggest using a subset
|> of an existing language. For the stack based system you could use Forth
|> ( now that there is an ANS standard, it should be quite portable) and for
|> a lisp like notation I would use Scheme or a subset of Scheme.
|>
|> While I like forth, scheme might be a better choice since there is a lot of
|> literature on how to optimize it.
For Forth there is also some literature:
@InProceedings{ertl92,
author = "M. Anton Ertl",
title = "A New Approach to {Forth} Native Code Generation",
crossref = "euroforth92",
pages = "73--78"
}
@Proceedings{euroforth92,
key = "EuroForth~'92",
title = "EuroForth~'92",
booktitle = "EuroForth~'92",
year = "1992",
organization = "MicroProcessor Engineering",
address = "Southampton, England"
}
Forth (or, in general, any language with programmer-visible stacks) is
converted into standard representations for optimization and code
generation, like SSA form and data flow graphs.
This paper is available at
ftp://ftp.complang.tuwien.ac.at/pub/papers/ertl92.ps.Z
- anton
--
M. Anton Ertl
anton@mips.complang.tuwien.ac.at
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.