Yes, the goal is to attach AST nodes to tokens and use them to disambiguate 
in cases where a Lexer-based approach can't decide.

  The thing is that we need a lexer-only approach anyway, e.g. to format code 
that has errors, is ifdef'd out or contains macros. Also, parsing the source 
code is time consuming, so invoking it should be optional, i.e. you can get a 
mostly well-formatted code quicker. So, I decided to start with that. However, 
there are definitely plans to use the power of Clang's parser in the future, 
this is just the very beginning.

http://llvm-reviews.chandlerc.com/D80
_______________________________________________
cfe-commits mailing list
[email protected]
http://lists.cs.uiuc.edu/mailman/listinfo/cfe-commits

Reply via email to