[cfe-dev] Evolution of advanced refactoring support

Manuel Klimek klimek at google.com
Tue Feb 26 12:28:05 PST 2013

On Tue, Feb 26, 2013 at 9:20 PM, Markus Elfring <Markus.Elfring at web.de>wrote:

>  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 ;)
> Can higher level analysis and software refactoring be performed by the
> means from variants of the knowledge  area "computation tree logic"?
> Would you like to map "ASG" matchers to a semantic patch language?

I'm not 100% sure what your question is :)

So, we are doing ongoing refactoring work based on the ast matchers - and
when I say refactorings, I really mean "code transformations".

About the "semantic patch language". To some degree we have a semantic
patch language. It just happens to be written as C++ code. Now, I'm aware
that for simple problems that not optimal, and I'd be curious to see
projects that try to address this, but we have put a lot of thought into it
and think that a project like that would have a lot of risk - so it'd
better fit into a research org.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/cfe-dev/attachments/20130226/49d58955/attachment.html>

More information about the cfe-dev mailing list