A useful data structure for equivalence computations is the ring structure. We use one pointer and an offset field in each symbol-table entry to link members of an equivalence set. This structure is suggested in Fig. 7.57 , where A, a, c, and Dare, equivalent. and E and F are equivalent. with the location of B being 20 words after that of A, and so on .
a) Give an algorithm to compute the offset of X relative (Q Y, assuming that X and Yare in the same equivalence set.
b) Give an algorithm to compute low and high, as defined in Section 7.9, relative to the Iocation of some name Z.
c) Give an algorithm to process
