Home Table of Contents News Blogs Opinion Research Practice Contributed Articles Review Articles Careers Archive Videos About Communications
Sign In
advertisement

Home → Magazine Archive → November 1968 (Vol. 11, No. 11) → The LRLTRAN compiler → Abstract

The LRLTRAN compiler

By Sam F. Mendicino, Robert A. Hughes, Jeanne T. Martin, Frank H. McMahon, John E. Ranelletti, Richard G. Zwakenberg

Communications of the ACM, Vol. 11 No. 11, Pages 747-755
10.1145/364139.364154

Extensive software problems confront an organization which possesses a number of different computers and which frequently acquire new ones. To maintain cohesion, a system must be developed, written in a high level language, which minimizes machine dependencies and isolates those which are necessary. A language and a compiler for that language are discussed here. The language, called LRLTRAN, is a heavily augmented FORTRAN. The three-pass compiler makes use internally of a postfix Polish notation (pass I to pass II) and a free representation referred to as a “composite blocking table” (pass I to pass III). Machine-independent optimization occurs in pass II and DO-loop and machine-dependent optimization in pass III.

The full text of this article is premium content

0 Comments

No entries found