Commit # 6600257 gives us the transformation signature for an input expression while it inflates the expression. Now it's time to use the signature to perform the transformation(s). Be sure to run the innermost transformations first so the enclosing ones (if any) can be agnostic about their interior. A left-to-right traversal should be sufficient for this because the transformation for any node is only catalogued after the recursive calls to both child nodes.
Some transformations are routine permutations of substrings such as the CONCAT transformation. Handle these generically. Certain others will likely need case-by-case handling.
Commit # 6600257 gives us the transformation signature for an input expression while it inflates the expression. Now it's time to use the signature to perform the transformation(s). Be sure to run the innermost transformations first so the enclosing ones (if any) can be agnostic about their interior. A left-to-right traversal should be sufficient for this because the transformation for any node is only catalogued after the recursive calls to both child nodes.
Some transformations are routine permutations of substrings such as the CONCAT transformation. Handle these generically. Certain others will likely need case-by-case handling.