Jürgen M. Janas
Abstract
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.
- Ganzinger, H., Ripken, K. Operator Identification in ADA: Formal Specification, Complexity, and Concrete Implementation. ACM SIGPLAN Notices 15, 2 (1980) pp 30--42 Google Scholar
Digital Library
- Preliminary ADA Reference Manual. ACM SIGPLAN Notices 14, part A (1979) Google ScholarDigital Library
Index Terms
- A comment on "operator identification in ADA" by Ganzinger and Ripken
Recommendations
The induced generalized OWA operator
We present the induced generalized ordered weighted averaging (IGOWA) operator. It is a new aggregation operator that generalizes the OWA operator, including the main characteristics of both the generalized OWA and the induced OWA operator. This ...
Stancu OWA Operator
A critical issue when selecting an ordered weighted aggregation (OWA) operator is the determination of the associated weights. For this reason, numerous weight generating methods have appeared in the literature. In this paper, a generalization of the ...
Continuous generalized OWA operator and its application to decision making
In this paper we present a new class of operators called the continuous generalized ordered weighted averaging (C-GOWA) operators, which extends the continuous ordered weighted averaging operator. To adapt to uncertain and complex situations in decision ...
Comments