ACM Home Page
Please provide us with feedback. Feedback
A One-Pass Algorithm for Overload Resolution in Ada
Full text PdfPdf (865 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 ,  Issue 4  (October 1982) table of contents
Pages: 601 - 614  
Year of Publication: 1982
ISSN:0164-0925
Author
T. P. Baker  Florida State University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 32,   Citation Count: 9
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/69622.69623
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
6
7
 
8
Reference Manual for the Ada Programming Language (proposed standard), U.S. Department of Defense, Washington, D.C., Nov. 1980.
9
 
10
WALLIS, R.J., AND SILVERMAN, R.W. Efficient implementation of the Ada overloading rules. Inf. Process. Lett. 10, 3 (Apr. 1980), 120-123.
 
11



REVIEW

"Terry S. Arnold : Reviewer"

This paper presents a one-pass algorithm for overload resolution in Ada. A description of the overloaded operator problem is presented by means of an example. The algorithm is based on a bottom up, left to right parse of an expression. It clearl  more...