[cfe-dev] RFC: Tree-based refactorings with Clang

Jan Korous via cfe-dev cfe-dev at lists.llvm.org
Mon Feb 25 12:37:10 PST 2019


Hi Ilya,

This looks awesome!

I am just curious - since the expected workflow is to always start with ASTMatchers do you plan to provide utilities to overcome limitations of AST you mention?

- Different ASTs for the same syntax
- Same ASTs for the different syntactic constructs

For example - do you plan to implement some functionality for separating a set of AST nodes based on their syntactic nature?

Thanks.

Jan


> On Feb 25, 2019, at 10:50 AM, Ilya Biryukov via cfe-dev <cfe-dev at lists.llvm.org> wrote:
> 
> Hi everyone, 
> 
> We would like to propose a new way of writing refactorings on top of the Clang infrastructure. Our is to have nice APIs that hide tedious tasks, like dealing with macros or adding parentheses around changed expressions. 
> 
> Design is discussed in detail here:
> https://docs.google.com/document/d/161XftOcF-ut1pGQr5ci9kXd_y0jRQl3y9sVyvuEkLDc/edit?usp=sharing 
> 
> Please let us know what you think either by adding comments to the document or directly in this thread.
> Eager to hear your thoughts!
> 
> -- 
> Regards,
> Ilya Biryukov
> _______________________________________________
> cfe-dev mailing list
> cfe-dev at lists.llvm.org
> https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-dev




More information about the cfe-dev mailing list