Some techniques used in the ALCOR ILLINOIS 7090

@article{Gries1965SomeTU,
  title={Some techniques used in the ALCOR ILLINOIS 7090},
  author={David Gries and Manfred Paul and Hans R{\"u}diger Wiehle},
  journal={Commun. ACM},
  year={1965},
  volume={8},
  pages={496-500}
}
An ALGOL compiler has been written by the ALCOR group for the IBM 7090. Some little known but significant techniques in compiler writing, together with organizational details of this compiler, are described. Timing estimates and an indication of compiler requirements are also given. 

Figures from this paper

The ALCOR Illinois 7090/7094 post mortem dump

A dump technique for programs written in ALGOL 60 that provides an intelligible analysis of an unsuccessful computation process in terms of the original source program.

SOME STATISTICS FROM ALGOL PROGRAMS

A substantial amount of statistical information is given of Algol programs run at the National Physical Laboratory, giving a clear indication of the weaknesses and merits of each one, as well as a comparison of their execution speeds.

Historical Remarks on Compiler Construction

The overwhelming lead of the USA in the general development of computers and their application, together with the language barrier, has in fact favoured negligence of early developments in Middle Europe and in the Soviet Union.

Program control via transition matrices: a novel application of micro-programming

The problem of processing and interpreting character-strings in a systematic, efficiently implementable manner has given rise to a variety of decision- (or transition-) table and transition-diagram techniques, all of which share the idea of an input driven transition control.

On the structure of dictionaries for compilers

The format of a dictionary (symbol table) adequate for a PL/I compiler is presented and emphasis is placed on the contents and structure of the attribute entries necessary to handle structures in a block environment.

Development of Correct Programs

  • D. Gries
  • Computer Science
    Edsger Wybe Dijkstra
  • 2022
In August 1967, Edsger wrote EWD209, later published as Dijkstra [1968a], in which he took an entirely different approach, and tackled the problem of developing programs and their proofs hand-in-hand, with the proof ideas leading the way.

Universality versus Locality: The Amsterdam Style of Algol Implementation

This article elaborates on the tension between universality and locality by contrasting the Amsterdam and Munich styles of programming by highlighting Edsger Dijkstra's concept of a machine-independent object language.

A dictionary structure for a PL/I compiler

  • Vincent A. Busam
  • Computer Science
    International Journal of Computer & Information Sciences
  • 2004
The format of a dictionary (symbol table) adequate for aPl/I compiler is presented and emphasis is placed on the contents and structure of the attribute entries necessary to handle structures in a block environment.

Symbolic derivatives without list processing, subroutines, or recursion

A routine has been developed which computes and prints out the symbolic derivative of an absolutely continuous elementary function of one or several variables and the chain rule is applied and the result is edited to produce results as elegant and efficient as those obtained by hand computation.

Program control via transition matrices: a novel application of micro-programming

A micro-coded interpreter (ITM) executes the flow-of-control implicit within the structure of the TM, which permits TM-oriented decision-making techniques to be utilized in virtually any task that can be described by means of transition matrix.

References

SHOWING 1-10 OF 15 REFERENCES

A method of syntax-checking ALGOL 60

A syntax checker was designed based on the syntax of ALGOL as a set of mutually recursive processors tied together by subroutines which perform certain bookkeeping functions which permits most programs to be checked completely despite errors.

A syntax controlled generator of formal language processors

An important general principle in processing formal languages was the cellar principle, introduced in 1957 by F. L. Bauer and K. Samelson, which proved to be applicable in translating programs from the algorithmic language ALGOL into machine code or into a computer-oriented, macro instruction language.

Syntactic Analysis and Operator Precedence

Three increasingly restricted types of formal grammar are phrase structure Grammars, operator grammars and precedence grammar, which form models of mathematical and algorithmic languages which may be analyzed mechanically by a simple procedure based on a matrix representation of a relation between character pairs.

Introduction to ALGOL

This book is very referred for you because it gives not only the experience but also lesson that will give wellness for all people from many societies.

Translation to and from Polish Notation

The question of efficient translation between an "orthodox" mathematical notation of the kind ordinarily used in writing algebraic formulae and "Polish" notation has come to prominence as a result of the use of what is in effect Polish notation as the basic instruction language of two recent computers.

Gebrauchsanleitung ffir die ERMETH. Institut ffir angew

  • Mathematik der ETH, Zfirich
  • 1959

A general processor for certain formal languages

  • Proc. 1962 Rome Symposium on Symbolic Languages in Data Processing
  • 1962

Efficient handling of subscripted variables in ALGOL 60 compilers

  • Proc. 1.962 Rome Symposium on Symbolic Languages in Data Processing
  • 1962