[antlr-interest] Writing an interactive interpreter with TreeParsers

[Sohail Somani]

On Sun, 2006-07-09 at 15:49 -0700, Loring Craymer wrote:
> Right the second time.  It isn't the number of stages to interpret stuff,
> it's the size of the input.  Once the input is valid (successful parse), you
> can process an AST.  The equivalent happens with Python, for example:  all
> input is converted into a parse tree, and then byte code before the byte
> code interpreter is invoked to process the statement(s).
> 
> --Loring

I had come to this conclusion as well as I've only(!) written a full
translator with antlr so far. Sounds alright to me.

Now I just have to figure out what I changed to make it not parse
anymore! Note to self: Put toy projects in svn too :)

Thanks!

Sohail