I'd like to walk people through my latest adventures with fast: A search/refactoring tool that work as a regular expression language to target AST nodes.

I built it originally for Ruby and now I'm also adding the support for SQL language.

This talk will be a walkthrough in the AST and the searching engine. The idea is expose my little "functional" toy and walk people through the parser and how the matching system works. Later we'll see how to use the AST Tree Rewriter to refactor code based on AST elements.