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. 
The ALCOR Illinois 7090/7094 post mortem dump
TLDR
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. Expand
SOME STATISTICS FROM ALGOL PROGRAMS
TLDR
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. Expand
Historical Remarks on Compiler Construction
  • F. L. Bauer
  • History, Computer Science
  • Compiler Construction
  • 1976
TLDR
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. Expand
On the structure of dictionaries for compilers
TLDR
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. Expand
Universality versus Locality: The Amsterdam Style of Algol Implementation
TLDR
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. Expand
A dictionary structure for a PL/I compiler
  • Vincent A. Busam
  • Computer Science
  • International Journal of Computer & Information Sciences
  • 2004
TLDR
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. Expand
Program control via transition matrices—a novel application of micro-programming
TLDR
A micro-coded implementation of a particularly rich concept—the transition matrix (TM) is described, which permits TM-oriented decision-making techniques to be utilized in virtually any task that can be described by means of a transition matrix. Expand
Symbolic derivatives without list processing, subroutines, or recursion
TLDR
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. Expand
Use of transition matrices in compiling
TLDR
The purpose of this paper is to illustrate that the technique is very efficient, and to describe an algorithm which generates a transition matrix from a suitable grammar, and other uses of transition matrices besides the usual ones of syntax checking and compiling. Expand
Translator writing systems
TLDR
A critical review of recent efforts to automate the writing of translators of programming languages is presented and various approaches to automating the postsyntactic aspects of translator writing are discussed. Expand
...
1
2
...

References

SHOWING 1-10 OF 15 REFERENCES
A method of syntax-checking ALGOL 60
TLDR
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. Expand
A syntax controlled generator of formal language processors
TLDR
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. Expand
Syntactic Analysis and Operator Precedence
TLDR
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. Expand
Introduction to ALGOL
Where you can find the introduction to algol easily? Is it in the book store? On-line book store? are you sure? Keep in mind that you will find the book in this site. This book is very referred forExpand
Translation to and from Polish Notation
TLDR
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. Expand
ALCOR ILLINOIS 7090---An ALGOL compiler for the IBM 7090
  • ALCOR ILLINOIS 7090---An ALGOL compiler for the IBM 7090
  • 1964
The object program produced by the ALCOR ILLI- NOIS 7090 compiler. Rep
  • Rechenzentrum der Tech. Hochsch
  • 1964
User's manual for the ALCOR ILLINOIS 7090 ALGOL-60 translator
  • User's manual for the ALCOR ILLINOIS 7090 ALGOL-60 translator
  • 1964
...
1
2
...