[cfe-dev] Evolution of advanced refactoring support
klimek at google.com
Tue Feb 26 11:40:41 PST 2013
On Tue, Feb 26, 2013 at 5:24 AM, Markus Elfring <Markus.Elfring at web.de>wrote:
> Would you like to distinguish a bit more if the matching process is
> performed on a syntactic or semantic abstraction level?
The matching is ont he clang AST, which is a fully type-resolved AST. Does
that answer it?
> Do you combine such "AST" matchers into a computation tree logic variant?
I'm not sure I understand what exactly you ask, but we're combining
matchers into a tree that than is matched against the AST (which is more of
a graph than a tree ;)
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cfe-dev