RTL/tree (from gcc) and Scheme

[Per Bothner]

Valery A.Khamenya wrote:

> PB> You asked for a GCC front-end for Scheme.
> 
> no, I've asked not for GCC front end, but for GCC's front end.
> It means RTL/tree.

In English (and GCC) usage, "GCC front end" and "GCC's front end"
mean the same thing, so I don't understand the distinction
you're trying to make.  Both mean "the language-specific part
of GCC that deals with parsing and semantic analysis."  The
"back-end" means "the target-specific (hardware-specific) parts
of GCC that deal with instruction selection and most optimizations".

> nice, could I treat your answer that kawa *already* can compile in
> run-time?

Definitely.  Kawa fully supports eval, load, and a read-eval-print loop.
To do that it compiles code at run-time.  (There is an interpreter, but
it is incomplete and only used for "simple" expressions.  "Non-simple"
expressions are always compiled to Java bytecodes.)

> PB> * You can compile the bytecode, save them in a file, invoke Gcj to
> PB> create a DLL, and load that at run-time.  At least in theory and with
> PB> a little bit of work - I don't know if anyone has done it.
> 
> solution through a file is not really nice. Indeed, is it then worth
> of single function compilation?

Probably not.

> PB> Because your question doesn't make sense.  RTL and Tree are data
> PB> structures internal to the GCC compiler.  They are not designed
> PB> for anything else.
> 
> hm, I am a bit confused. At least Fortran, Ada and Java provided with
> gcc distribution use the same RTL/tree as far as I understood... or am
> I wrong?.. 

Your question was about *run-time" use or RTL/tree.  All of those
languages use trees and RTL for *compile-time* only.
-- 
	--Per Bothner
per@bothner.com   http://per.bothner.com/