Reconstruct the original file by visiting/walking all nodes

[antlrLearner]

Please help to visit all nodes sequentially starting from the root node in the order they appear in the input file in C#

Even though the parse rules are written in order, the text in the input file may not appear in the same order. 

Goal is to replace certain text in the file and rewrite the original file.

Thank you

[Mike Lischke]

Please help to visit all nodes sequentially starting from the root node in the order they appear in the input file in C#

Even though the parse rules are written in order, the text in the input file may not appear in the same order. 

Goal is to replace certain text in the file and rewrite the original file.

I'm also working on a project where file content is parsed (though not with ANTLR) and parts are replaced. I recommend that you not walk the entire parse tree but instead use the token informations you have. Each token comes with start and stop index in the original char stream. Use that to copy text you don't want to replace verbatim. Then add the replaced text for your token and do the same steps in a loop for all other tokens you want to replace. That avoids the need to reconstruct the original text from information you might not have (e.g. hidden whitespaces).

Mike
-- 
www.soft-gems.net

[Mike Cargal]

Take a look at TokenStreamRewriter

--
You received this message because you are subscribed to the Google Groups "antlr-discussion" group.
To unsubscribe from this group and stop receiving emails from it, send an email to antlr-discussi...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[antlrLearner]

Mike,

As Mike pointed in the below thread TokenStreamRewriter is powerful, and in the lexer have to modify the whitespace, new line, comments rule to channel(HIDDEN) instead of SKIP.

[antlrLearner]

Thank you Mike