PUFFT—The Purdue University fast FORTRAN translator

e handles only those eases in which n is both positive :1 nperatives can dea.1 with any data which is ressed by a linear string of characters. A wide formatiott can be expressed in these terms in-te of the special notations of pure mathematics, sties, chemistry and electrical engineering. !or further investigation is the manipulation of :t information contained in diagrams. Trans-near form, this information might be treated kspaee by AXLE imperatives and assertions which themselves nmy be transformations of inform~tio~ produeed by a light pen. A possibIe extension to the AXLE language will permit the computer to make inferences during run time. For this purpose a facility is needed for permitting the computer itself to change imperative and assertion tables as a result of earlier operz:~tions on t.he workspaee. IONNELLY iversil:q, ~ Lafizyelte, Indiana ..sident, compile-and-go system designed for the '094 computer is described. In little more than half word core memory PUFFT provides a monitor for ng, a translator for the full FORTRAN IV language, q subroutine library, an input-output system for use ime and at execute time, and a rather elaborate aessage writing routine. Batches of small-and :1 FORTRAN IV source language programs are t very high speeds. Language compatibility has ined so that programs may be debugged in the rn and then recompiled and run in the IBJOB-, supptied by the manufacturer. ction lem of cutting down the overhead required by ring systeln is especially acute in an environ-,, typical daily run may consist of many hunt T short programs, Mong with relatively few 7his is typical of a computing center at a large vhere the computer is used extensively as an device. : of l?rogramming systems have been developed affiliation: RCAEDP I)ivision, Cherry Hill, New r Sciences Department.