Re: speed-up parsing

[Christian Kristukat]

On Tuesday 18 June 2002 12:33, Anthony DeRobertis wrote:
> Parse f(a,b,c) by building an abstract syntax tree, which would look
> something like this:
>
>             f()
>            / | \
>           /  |  \
>          /   |   \
>         a    b    c
>
> Now, once you have built this, there is no reason to call the parser
> again. The AST will not change.

Ok, now for the beginner: after having changed the values in the parser's 
symbol table how can I tell the program the evaulate the expression again?

Christian