[antlr-interest] Re : incremental

[Rampon Jerome]

I agree with your approach.
As AST from ANTLR is somewhere a dependency graph, I imagined originally we could compare a second run over a bunch of input files (vs previous AST more or less automated) to get new AST with modified or non modified info  added so that any tree parser actions could use directly for its own caching.
ANTLR keeps track of line and column, it could keep track of input stream+timestamps.
Idea was also to propagate info at each node level and not only file level.
I can do it with an ASTcompare + inputstream & timestamp data ... by my own or at a lower level in my application.
I wondered if anything in that sense could exist in ANTLR as I missed in doc. Apparently, there is nothing from you response.

Thanks

Jerome

Do you have a particular application where this approach would fail, but
incremental parsing within the file would succeed?

Sam

-----Original Message-----
From: antlr-interest-bounces at antlr.org
[mailto:antlr-interest-bounces at antlr.org] On Behalf Of Rampon Jerome
Sent: Friday, September 30, 2011 12:33 PM
To: antlr-interest at antlr.org
Subject: [antlr-interest] Re : incremental



Hi,


Compilers/parsers are often used over files slightly modified (error
correction, whatever minor changes, ....) Efficient applications may desire
to implement incremental abilities (to speed-up runtime).

Those incremental abilities can be integrated at different levels
(application, parser, ...).
Of course, the sooner you can collect data/changes, the best you incremental
mechanism will be.

I did not find any topic related about in ANTLR documentation for such any
support.
If anything exists, could you please let me know as part of my interest ?

Thanks

J.Rampon

List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.org/mailman/options/antlr-interest/your-email-address