Parsing results in an AST that is "decorated" mostly by means of hashtables
that link AST nodes to other pieces of information (such as other AST
nodes). There is some rudimentary mechanism (see evalCache in Evaluator) to
avoid recomputing these hashtables completely when the AST changes *but*
(1) this mechanism is not always used, (2) this mechanism doesn't help in
some situations (e.g. building the flow-graph), and (3) the hashtables do
not "forget" information about AST nodes that are no longer interesting
*and* prevents garbage collection.
There should be some systematic way of decorating ASTs with persistent
information.
This is the c(h)ore of (implementing) the new edit&verify scheme.
Original issue reported on code.google.com by radugrig...@gmail.com on 15 Sep 2009 at 4:01
Original issue reported on code.google.com by
radugrig...@gmail.comon 15 Sep 2009 at 4:01