The LRLTRAN compiler
- 1 November 1968
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 11 (11), 747-755
- https://doi.org/10.1145/364139.364154
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- Scatter storage techniquesCommunications of the ACM, 1968