article

Free access

Overloading in preliminary Ada

Authors:

Guido Persch,

Georg Winterstein,

Manfred Dausmann,

Sophia DrossopoulouAuthors Info & Claims

ACM SIGPLAN Notices, Volume 15, Issue 11

Pages 47 - 56

https://doi.org/10.1145/947783.948640

Published: 01 November 1980 Publication History

PDF eReader

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.

References

[1]

{Ada} Preliminary Ada Reference Manual SIGPLAN notices 6/79

Digital Library

Google Scholar

[2]

{OAG} U. Kastens Ordered Attributed Grammars Acta Informatica 13, pp. 229--256, 1980

Google Scholar

[3]

{OVER} G. Persch et al. Overloading in Ada Universität Karlsruhe, Institut f. Informatik II Bericht 23/79, Nov. 1979 previous version of this paper

Google Scholar

[4]

{Rat} Rationale for the Design of the Ada Programming Language SIGPLAN notices 6/79

Digital Library

Google Scholar

[5]

{STEEL} DoD Steelman Report June 1978

Google Scholar

Cited By

View all

Kastens UWaite W(2017)Name analysis for modern languages: a general solutionSoftware: Practice and Experience10.1002/spe.248947:11(1597-1631)Online publication date: 13-Mar-2017
https://doi.org/10.1002/spe.2489
Kastens UWaite W(2009)Reusable specification modules for type analysisSoftware: Practice and Experience10.1002/spe.91739:9(833-864)Online publication date: 29-Jan-2009
https://doi.org/10.1002/spe.917
Kadhim BWaite W(2005)Maptool — supporting modular syntax developmentCompiler Construction10.1007/3-540-61053-7_67(268-280)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61053-7_67
Show More Cited By

Overloading in preliminary Ada
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Overloading in preliminary Ada
SIGPLAN '80: Proceedings of the ACM-SIGPLAN symposium on Ada programming language

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 ...
Overloading in preliminary Ada
SIGPLAN '80: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language

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 ...
An efficient method for handling operator overloading in Ada
AdaTEC '82: Proceedings of the AdaTEC Conference on Ada

The coupling of type derivation with operator overloading occupies a substantial portion of the type-checking activities of an Ada compiler. It is thus important to handle overloaded operators as efficiently as possible. Let us recall that the ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 15, Issue 11

Proceedings of the ACM-SIGPLAN symposium on the Ada programming language

November 1980

242 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/947783

Issue’s Table of Contents

SIGPLAN '80: Proceedings of the ACM-SIGPLAN symposium on Ada programming language
December 1980
249 pages
ISBN:0897910303
DOI:10.1145/948632
Conference Chair:
Paul Abrahams
Deerfield, MA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1980

Published in SIGPLAN Volume 15, Issue 11

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
259
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)11

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kastens UWaite W(2017)Name analysis for modern languages: a general solutionSoftware: Practice and Experience10.1002/spe.248947:11(1597-1631)Online publication date: 13-Mar-2017
https://doi.org/10.1002/spe.2489
Kastens UWaite W(2009)Reusable specification modules for type analysisSoftware: Practice and Experience10.1002/spe.91739:9(833-864)Online publication date: 29-Jan-2009
https://doi.org/10.1002/spe.917
Kadhim BWaite W(2005)Maptool — supporting modular syntax developmentCompiler Construction10.1007/3-540-61053-7_67(268-280)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61053-7_67
Keller PMaas T(2005)An OPTRAN-generated front-end for AdaAttribute Grammars and their Applications10.1007/3-540-53101-7_19(266-283)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-53101-7_19
Goos GWinterstein G(2005)Problems in compiling AdaTrends in Information Processing Systems10.1007/3-540-10885-8_38(173-199)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-10885-8_38
Gray RLevi SHeuring VSloane AWaite W(1992)Eli: a complete, flexible compiler construction systemCommunications of the ACM10.1145/129630.12963735:2(121-130)Online publication date: 1-Feb-1992
https://dl.acm.org/doi/10.1145/129630.129637
Baker T(1982)A single-pass syntax-directed front end for AdaACM SIGPLAN Notices10.1145/872726.80700617:6(318-326)Online publication date: 1-Jun-1982
https://dl.acm.org/doi/10.1145/872726.807006
Baker TWhite JAllen F(1982)A single-pass syntax-directed front end for AdaProceedings of the 1982 SIGPLAN symposium on Compiler construction10.1145/800230.807006(318-326)Online publication date: 23-Jun-1982
https://dl.acm.org/doi/10.1145/800230.807006
Baker T(1982)A One-Pass Algorithm for Overload Resolution in AdaACM Transactions on Programming Languages and Systems10.1145/69622.696234:4(601-614)Online publication date: 1-Oct-1982
https://dl.acm.org/doi/10.1145/69622.69623
Goos GWinterstein G(2019)Towards a compiler front-end for AdaACM SIGPLAN Notices10.1145/947783.94863915:11(36-46)Online publication date: 13-Nov-2019
https://dl.acm.org/doi/10.1145/947783.948639
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations