[cfe-dev] Auto-generation of ASTMatchers predicates from source code, proof-of-concept
evgeny.panasyuk at gmail.com
Tue Jun 19 05:21:58 PDT 2012
18.06.2012 0:05, Manuel Klimek wrote:
>> Or maybe about some interactive (maybe gui) tool for building
>> predicates? I remember that Chandler mentioned about
>> something similar at
>> Now we're talking the next step :) Yea, having a GUI would be
>> *great* (and just so we're clear: with GUI I mean a web page :P)
> And maybe AST database optimized for fast predicate matches :)
> For small projects this might be interesting - for us the question is
> how that would scale - we've found parsing the C++ code to be actually
> an interesting way to scale the AST, for the small price of needing up
> 3-4 seconds per TU (on average). Denormalizing the AST itself produces
> a huge amount of data, and denormalizing even more seems like a
It depends on how much you would like to scale. And yes, it also depends
on project sizes.
For instance, if required scaling is task per TU - it is one case.
If required scaling is many tasks (tens, hundreds) per TU - it is
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cfe-dev