Related articles |
---|
backend question doeringm@gmx.de (Martin Doering) (2002-11-12) |
Re: backend question dnovillo@redhat.com (Diego Novillo) (2002-11-13) |
Re: backend question hannah@schlund.de (Hannah Schroeter) (2002-11-13) |
Re: backend question fjh@cs.mu.OZ.AU (Fergus Henderson) (2002-11-13) |
Re: backend question joachim_d@gmx.de (Joachim Durchholz) (2002-11-13) |
Re: backend question thp@cs.ucr.edu (2002-11-17) |
Re: backend question joachim_d@gmx.de (Joachim Durchholz) (2002-11-20) |
Re: backend question chase@world.std.com (David Chase) (2002-11-20) |
Re: backend question reig@tenerife.ics.uci.edu (Fermin Reig) (2002-11-24) |
[13 later articles] |
From: | "Hannah Schroeter" <hannah@schlund.de> |
Newsgroups: | comp.compilers |
Date: | 13 Nov 2002 12:15:01 -0500 |
Organization: | Schlund + Partner AG |
References: | 02-11-063 |
Keywords: | translator |
Posted-Date: | 13 Nov 2002 12:15:01 EST |
Hello!
Martin Doering <doeringm@gmx.de> wrote:
>If I would like to write a native compiler for a toy language (just
>for my personal interest), the hardest thing for me is to generate
>code for a specific processor in the end. So my question is, if I
>could skip this last step by just using some well know intermediate
>format? ...
>[These days the most popular intermediate format is C. -John]
Yes. Another approach (been there, done that) is to parse your
toy language into Lisp data structures and to compile it using
(compile 'nil foo), heavily using macros to do the real transformation
work.
Kind regards,
Hannah.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.