WATFOR—The University of Waterloo FORTRAN IV compiler

Shantz, Peter W.; German, Reinhard; Mitchell, J. G.; Shirley, Robin; Zarnke, C. Robert

doi:10.1145/363018.363059

Cited by 24 publications

(6 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These conditions are generally found in educational and research environments. Historically, load-and-go compilers have been designed to run on large-scale computing systems (Cress, 1969;Rosen, 1965;Shantz, 1967;WATBOL, 1972~. It has Been only recently that load-and-go compilers have generally been implemented on mini-computers.…”

Section: Load-and-go Compilationmentioning

confidence: 99%

Development of educational software using the DEC PDP-11

Cowan¹,

Dirksen²,

Graham³

et al. 1976

Proceedings of the ACM SIGMINI/SIGPLAN Interface Meeting on Programming Systems in the Small Processor Environment - SIGMINI '

View full text Add to dashboard Cite

During the past two years, the Waterloo Foundation for the Advancement of Computing (WATFAC) and the University of Waterloo have been developing educational software in a number of projects using DEC PDP-II mini-computers. These projects include the development of WATFOR-II (a load-and-go FORTRAN compiler), WATBOL-II (a load-and-go COBOL compiler), and WIDJET Ca student editing and job-entry system). This paper presents a survey of these projects and discusses several problems encountered during their implementation.

show abstract

Section: Load-and-go Compilationmentioning

confidence: 99%

Development of educational software using the DEC PDP-11

Cowan¹,

Dirksen²,

Graham³

et al. 1976

Proceedings of the ACM SIGMINI/SIGPLAN Interface Meeting on Programming Systems in the Small Processor Environment - SIGMINI '

View full text Add to dashboard Cite

show abstract

“…Recent discussions in technical literature, such as [4][5][6], show that increasing emphasis is being placed on this previously neglected aspect of programming, primarily at universities, where th~ typical student workload is such that minimizing compilation time, ignoring execute time (which is trivial, in any case), attd maximizing diagnostics are the appropriate language implementation design goals.…”

Section: Diagnostics: Facilities and Implementation Techniquementioning

confidence: 99%

An Elementary Discussion of Compiler/Interpreter Writing

Glass

1969

ACM Comput. Surv.

View full text Add to dashboard Cite

Elementary techniques are described for the implementation of compilers, ' interpreters, and translators of programming languages. An overview of such a language processor is presented, followed by a detailed discussion of certain building blocks useful in its construction. Frequent reference is made to a specific implementation, that of a PL/I interpreter called SPLINTER (Scientific PL/I INTERpreter) on the UNIVAC 1108 at Boeing.

show abstract

“…Statement [3] constructs p* and C* and invokes the OPTIMAL function. Statements [4] and ll pP [2] L /lxN [3] ( [5] print a description of the optimal feasible solution. Statement [4] prints the optimal objective function value.…”

mentioning

confidence: 99%

“…Statements [4] and ll pP [2] L /lxN [3] ( [5] print a description of the optimal feasible solution. Statement [4] prints the optimal objective function value. The kth row printed by statement [5] represents an assignment S; of N~N' to some gk E G j , where: Sk = 1sin 1,1 E N', (s > 0) =?…”

mentioning

confidence: 99%

See 1 more Smart Citation

Compiler assignment of data items to registers

Day¹

1970

IBM Syst. J.

View full text Add to dashboard Cite

This paper formulates as integer programming problems three methods for assigning data items to registers in the compilation process-r-the one-one, many-one, and many-few global assignment methods.Three algorithms are described for obtaining feasible solutions to the many-one and many-few global assignment problems. One provides an optimal solution. The others, which provide good approximations, appear to be sufficiently fast for inclusion in an optimizing compiler.The assignment of data items to registers is one of the functions performed by a compiler during the preparation of a program for execution. The way in which this function is performed affects the execution characteristics of the program. A good register assignment scheme can, for example, reduce the number of movements of data items between main storage and registers and can allow use of the faster register-to-register type instructions. In this paper, we consider three related methods of assigning data items to registers.After establishing some basic definitions and assumptions, and distinguishing between global and local assignment, we discuss the three methods of global assignment-c-one-one, many-one, and many-few.Global one-one assignment associates exactly one data item with each register in the region of assignment. The method is interesting because it is used in commercially available compilers. In this paper, it is used as a standard for measuring the effectiveness of the many-one and many-few global assignment methods.Global many-one assignment associates at least one data item with a single register in the region of assignment. We describe a branch-and-bound procedure for obtaining optimal solutions to No.4· 1970 ASSIGNING DATA ITEMS TO REGISTERS 281

show abstract

WATFOR—The University of Waterloo FORTRAN IV compiler

Cited by 24 publications

References 2 publications

Development of educational software using the DEC PDP-11

Development of educational software using the DEC PDP-11

An Elementary Discussion of Compiler/Interpreter Writing

Compiler assignment of data items to registers

Contact Info

Product

Resources

About