Write an algorithm that takes two syntax trees Tr and Tr as inputs and returns true if they are identical and false otherwise. Recall from Section 9.5 that a leaf node might be a function name, say...

Write an algorithm that takes two syntax trees Tr and Tr as inputs and returns true if they are identical and false otherwise. Recall from Section 9.5 that a leaf node might be a function name, say foo. In this case your algorithm must traverse the CFG of f , and the corresponding syntax trees, to determine equivalence.