[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: speed-up parsing
From: |
Christian Kristukat |
Subject: |
Re: speed-up parsing |
Date: |
Tue, 18 Jun 2002 13:50:57 +0200 |
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
Re: speed-up parsing, Christian Kristukat, 2002/06/20