Overloading in preliminary Ada

Abstract

Ada permits the overloading of enumeration literals, aggregates, subprograms and operators, i.e. the declaration of the same designator with different meanings in the same scope. This leads to difficulties during the semantic analysis of expressions and subprogram calls. For selecting the meaning not only the designator but also the types of its operands or parameters and the type of its result must be used. We show that the identification of expressions is possible in two passes, the first bottom-up, the second top-down.