In examples, multiple has codes (or ranking values) may be computed simultaneously when traversing an expression tree. For example, a first hash code may be generated that can be used to capture the signature of the tree (e.g., +*/ meaning a tree with a + operator followed by a * fo...