|Example interpreter C firstname.lastname@example.org (Henry Butwsky) (2005-08-13)|
|Re: Example interpreter C email@example.com (Laurence Finston) (2005-08-16)|
|Re: Example interpreter C firstname.lastname@example.org (Rafael 'Dido' Sevilla) (2005-08-16)|
|Re: Example interpreter C email@example.com (2005-08-21)|
|Re: Example interpreter C firstname.lastname@example.org (Laurence Finston) (2005-08-21)|
|Re: Example interpreter C email@example.com (George Neuner) (2005-08-24)|
|Re: Example interpreter C Markus.Elfring@web.de (2005-08-24)|
|Re: Example interpreter C firstname.lastname@example.org (Julian Stecklina) (2005-08-31)|
|Re: Example interpreter C email@example.com (Joerg Simon) (2005-09-02)|
|[5 later articles]|
|From:||Rafael 'Dido' Sevilla <firstname.lastname@example.org>|
|Date:||16 Aug 2005 11:18:44 -0400|
|Organization:||Imperium Technology Inc.|
|Posted-Date:||16 Aug 2005 11:18:44 EDT|
Henry Butwsky wrote:
> I understand that I need to write a parser that creates and AST
> (abstract symbol table) . Can any one point in the direction of an
> such an expale interpreter ?
First of all, AST == Abstract Syntax Tree.
If you want an example of the incremental development of an interpreter,
you might want to look for the Kernighan and Pike classic book: "The
Unix Programming Environment". There's a whole chapter there where they
follow the development of an interactive interpreter for a small
language called "hoc", from a simple four-function calculator, to one
with simple memory, to one that allows for variables, to one that has
control flow and looping constructs, to one that actually has
That book was new in 1984, and it's surprising to see how much of it is
still perfectly applicable to modern Unix variants today.
General purpose money is what allows people to trade tracts of rain
forest for Coca-Cola.
Return to the
Search the comp.compilers archives again.