The LRLTRAN compiler

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.

REFERENCES

• 1: MENDICINO, S. F., STORCH F. D., AND SUTHERLAND, G. G. LRL FORTRAN-FORTRAN. UCRL-7737-T, Lawrence Radiation Lab., Livermore, Calif., Feb. 1964.
• 2: AND SUTHERLAND, C. G. FORTRAN-FORTRAN, Part II. UCRL-12330, Lawrence Radiation Lab., Livermore, Calif., Feb. 1965.
• 3: --, AND ZWAKENBERG, R. G. A FORTRAN code optimizer for CDC 6600. UCRL-14162, Lawrence Radiation Lab., Livermore, Calif., April 1965.
• 4: FRITSCH, F. N., AND THEALL, G. E. LRLTRAN language manual. CIC Manual L, Computer Information Center, Lawrence Radiation Lab., Livermore, Calif., Nov. 1967.
• 5: MENDICINO, S. F., ET AL. CHAT-a conversational compiler. CIC Misc. Publ. 25, Computer Information Center, Lawrence Radiation Lab., Livermore, Calif., Dec. 1967.
• 6: Robert Morris, Scatter storage techniques, Communications of the ACM, v.11 n.1, p.38-44, Jan. 1968 [doi>10.1145/362851.362882]

INDEX TERMS

Keywords:
Polish processor, common subsegments, compiler, compiler-compiler, machine independence, optimization, scatter storage technique, tree representations