Thumbnail
Access Restriction
Subscribed

Author Ranelletti, John E. ♦ Hughes, Robert A. ♦ Mendicino, Sam F. ♦ McMahon, Frank H. ♦ Martin, Jeanne T. ♦ Zwakenberg, Richard G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Compiler ♦ Machine independence ♦ Scatter storage technique ♦ Tree representations ♦ Polish processor ♦ Common subsegments ♦ Optimization ♦ Compiler-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.
Description Affiliation: Univ. of California, Livermore (Mendicino, Sam F.; Hughes, Robert A.; Martin, Jeanne T.; McMahon, Frank H.; Zwakenberg, Richard G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 11
Issue Number 11
Page Count 9
Starting Page 747
Ending Page 755


Open content in new tab

   Open content in new tab
Source: ACM Digital Library