T. P. Baker
- 1 BELMONT, P. Type resolution in Ada: An implementation report. SIGPLAN Notices (ACM) 15, 11 (Nov. 1980), 57-61. Google Scholar
- 2 CORMACK, G.V. An algorithm for the selection of overloaded functions in Ada. SIGPLAN Notices (ACM) 16, 2 (Feb. 1981), 48-52. Google Scholar
- 3 GANZINGER, H., AND I~IPKEN, K. Operator identification in Ada: Formal specification, complexity, and concrete implementation. SIGPLAN Notices (ACM) 15, 2 (Feb. 1980), 30--42. Google Scholar
- 4 ICHBiAH, J., HELiARD, J., ROUBINE, O., BARNES, J., KRIEG-BRUECKNER, B., AND WICHMANN, B. Rationale for the design of the Ada programming language. SIGPLAN Notices (ACM) 14, 6, pt. B (June 1979), 7-8-7-12. Google Scholar
- 5 JANAS, J.M. A comment on "Operator identification in Ada" by Ganzinger and Ripken. SIG- PLAN Notices (ACM) 15, 9 (Sept. 1980), 39-43. Google Scholar
- 6 PENNELLO, T., DEREMER, F., AND MEYERS, R. A simplified operator identification scheme for Ada. SIGPLAN Notices (ACM) 15, 7 (July 1980), 82-87. Google Scholar
- 7 PERSCH, G., WINTERSTEIN, G., DAUSMANN, M., AND DROSSOPOULOU, S. Overloading in preliminary Ada. SIGPLAN Notices (ACM) 15, 11 (Nov. 1980), 47-56. Google Scholar
- 8 Reference Manual for the Ada Programming Language (proposed standard), U.S. Department of Defense, Washington, D.C., Nov. 1980.Google Scholar
- 9 SHERMAN, M. A flexible semantic analyzer for Ada. SIGPLAN Notices (ACM) 15, 11 (Nov. 1980), 62-71. Google Scholar
- 10 WALLIS, R.J., AND SILVERMAN, R.W. Efficient implementation of the Ada overloading rules. Inf. Process. Lett. 10, 3 (Apr. 1980), 120-123.Google Scholar
- 11 WEGNER, P. Programming with Ada: An Introduction by Means of Graduated Examples. Prentice-Hall, Englewood Cliffs, N.J., 1980. Google Scholar
Index Terms
- A One-Pass Algorithm for Overload Resolution in Ada
Recommendations
Super-Resolution from One Single Low-Resolution Image Based on R-KSVD and Example-Based Algorithm
IDEAL 2013: Proceedings of the 14th International Conference on Intelligent Data Engineering and Automated Learning --- IDEAL 2013 - Volume 8206With the development of sparse coding and compressive sensing, image Super-resolution SR reconstruction attracts extensive attentions. In this paper, we mainly focus on recovering super-resolution version given only one single low-resolution LR image. ...
One-Pass Wavelet Decompositions of Data Streams
We present techniques for computing small space representations of massive data streams. These are inspired by traditional wavelet-based approximations that consist of specific linear projections of the underlying data. We present general sketch -based ...
Image super-resolution: use of self-learning and gabor prior
ACCV'12: Proceedings of the 11th Asian conference on Computer Vision - Volume Part IIIRecent approaches on single image super-resolution (SR) have attempted to exploit self-similarity to avoid the use of multiple images. In this paper, we propose an SR method based on self-learning and Gabor prior. Given a low resolution (LR) test image ...
Reviews
Terry S. Arnold
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 clearly is intended to work in concert with a LALR(1) parser. The algorithm is informally compared with previously published multipass algorithms in terms of time and space complexity. The conclusion is reached that the multipass algorithms may be superior in terms of space for pathological cases, but come out equal for real-world cases. This algorithm should be of interest to implementors of compilers for Ada or other languages which employ operator overloading facilities.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments