|Executing code without generating stack machine code email@example.com (2005-04-26)|
|Re: Executing code without generating stack machine code firstname.lastname@example.org (Carlos) (2005-04-30)|
|Re: Executing code without generating stack machine code email@example.com (2005-04-30)|
|Date:||30 Apr 2005 10:57:14 -0400|
|Posted-Date:||30 Apr 2005 10:57:14 EDT|
> I was wondering if I could execute code from its tree
> representation without generating any intermediate code. At the least
> my language supports if/then/else, loops, procedures, goto's and
> expressions. This would allow me to avoid the extra stack machine
> processor code, required to run the intermediate code.
> Thank You,
> [Sure. Interpreting trees is not hard. -John]
Circa 1994-1995, Al Stevens wrote a C interpreter: QNC.
C source to interpret, is tokenized in some data structure (not byte
codes), and then interpreted.
QNC use another package of Mr Stevens, DFLAT.
The files are not available any more at the
author site's: ftp://ftp.alstevens.com/
But using an ftp-search, i found these 3 files:
Hope it helps !
Return to the
Search the comp.compilers archives again.