Compiling routines

  • Authors:
  • Richard K. Ridgway

  • Affiliations:
  • -

  • Venue:
  • ACM '52 Proceedings of the 1952 ACM national meeting (Toronto)
  • Year:
  • 1952

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since the advent of automatic computation, programmers have devoted much of their time and energy to looking up, adjusting, and transcribing material previously programmed. This has proved a most inefficient method of program preparation. Within the experience of the programming staff of Eckert-Mauchly, such manipulation and transcription has been a major source of programming errors. In an attempt to lighten the load on the programmer, and to eliminate such errors, members of the Computational Analysis Laboratory have devised programs called “compilers”. A compiler looks up subroutines, adjusts them, and assembles them, as a complete program. The fruitfulness of the compiler method of program preparation is now clearly evident. One immediate result is a considerable saving in time in the preparation of programs for the solution of mathematical problems. At present, compilers are capable of handling scientific problems, and in the near future, they will be available to treat commercial problems.