Preliminary Ada reference manual
ACM SIGPLAN Notices - Preliminary Ada reference manual
A One-Pass Algorithm for Overload Resolution in Ada
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimized overload resolution and type matching for Ada
SETA1 Proceedings of the first international symposium on Environments and tools for Ada
A single-pass syntax-directed front end for Ada
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
| Hi-index | 0.00 |
In a recent technical contribution [1], H. Ganzinger and K. Ripken investigate the impacts of the ADA overloading rule for the problem of operator identification; they show that operator identification may be achieved by at most four passes over the expression trees. While this theoretical result is correct, the procedure suggested for traversing the expression trees is insufficient in several ways. A correct version of the algorithm obviously intended by the authors is given below. Thereby the same notation as in [1] is used; in particular, T(v) stands for the type set and O(v) for the operator set associated with a node v in the expression tree.