Streamline multiplicative syntax processing calls

Currently, there are many functions which follow a similar recursive processing of the syntax tree (nearly identical to Hadley's `bquote2` function in [Advanced R: Expressions](http://adv-r.had.co.nz/Expressions.html).

Instead of iteratively performing operations across the same datastructure, it would drastically reduce the performance cost of running the static code analysis if all of these operations could be composed into a single operation (or a minimal subset of operations) which can then be lifted over the syntax tree in a minimal set of passes.

This is a long-term goal once the core functionality has stabilized.

Start by locating the functions that recursively process the syntax tree and compare their behavior with Hadley’s bquote2 function in Advanced R: Expressions. Determine how these operations can be composed into a minimal set of passes. Done means reducing repeated traversal while preserving the static analysis functionality and improving its performance.

Written by the indexing model from the issue text.