TL;DR: The ACM ALGOL committee has carefully studied the various proposals in an attempt to define a set of conventions for doing input and output which would be suitable for use on most computers, and the present report constitutes the recommendations of that committee.
Abstract: The ALGOL 60 language as first defined made no explicit reference to input and output processes. Such processes appeared to be quite dependent on the computer used, and so it was difficult to obtain agreement on those matters. As time has passed, a great many ALGOL compilers have come into use, and each compiler has incorporated some input-output facilities. Experience has shown that such facilities can be introduced in a manner which is compatible and consistent with the ALGOL language, and which (more importantly) is almost completely machine-independent. However, the existing implementations have taken many different approaches to the subject, and this has hampered the interchange of programs between installations. The ACM ALGOL committee has carefully studied the various proposals in an attempt to define a set of conventions for doing input and output which would be suitable for use on most computers. The present report constitutes the recommendations of that committee.
TL;DR: The main features of Algol 68 are explained from a semantic point of view and it is shown how the language permits the composition of values and actions from a minimum set of primitives with a few fundamental recursive rules of composition.
Abstract: The main features of Algol 68 are explained from a semantic point of view It is shown how the language permits the composition of values and actions, ie ultimately programs, from a minimum set of primitives with a few fundamental recursive rules of composition The associated syntax is briefly reviewed An attempt has been made to obtain a structured and simple introduction to both Algol 68 and its orthogonal desgn
TL;DR: In this paper some of the more obscure features of the language are considered and their usefulness is discussed, and ALGOL seems to have become too general.
Abstract: The ALGOL 60 Report,* when first encountered, seems to describe a very complex language which will be difficult to learn. The “metalinguistic formulae” admirably serve the purpose of precisely specifying a language, but they are certainly not very readable for a beginner. However, experience has shown that once the report is explained it is in fact easy to learn ALGOL and to write algorithms in it. The language is so general and powerful it can handle an enormous class of problems.It is not hard to learn those parts of ALGOL present in other compiler languages: how to write assignment and go to and for statements, etc. Indeed, a lot of the unnecessary restrictions imposed by other compiling languages have finally been lifted. But ALGOL also allows many unobvious things to be written, as we will see later, and herein lies a problem: ALGOL seems to have become too general. So many restrictions have been lifted that a lot of technical details crop up which are hard to learn and to use correctly. In this paper some of the more obscure features of the language are considered and their usefulness is discussed. Remarks are based on the authors' interpretations of the ALGOL 60 Report.
TL;DR: A comprehensive treatment of the implementation of high-level programming languages, particularly modern languages such as ALGOL 60, ALGol 68, Pascal, and Ada, and practical exercises with solutions.
Abstract: A comprehensive treatment of the implementation of high-level programming languages, particularly modern languages such as ALGOL 60, ALGOL 68, Pascal, and Ada. Emphasizes the design of compilers as well as the practical aspects of compiler writing including lexical analysis, syntax analysis, use of symbol tables, storage allocation, and code generation. Identifies the features of particular languages and describes algorithms in an actual language (ALGOL 68). Includes practical exercises with solutions.
TL;DR: The design of Formula Algol represents an effort to combine various different kinds of processing into one language, providing formula manipulating, list processing, and limited string capabilities.
Abstract: : In earlier years algebraic languages, list processing languages and string manipulating languages have existed separately from one another. Recently, formula manipulating languages have evolved, and, in addition, there have been efforts to combine various different kinds of processing into one language. The design of Formula Algol represents an effort in this direction. Specifically, Formula Algol is an extension to Algol providing formula manipulating, list processing, and limited string capabilities. Thus, Formula Algol is a language in which the advantages of these various different kinds of processing are combined, but we anticipate that Formula Algol will be particularly well adapted to algebraic symbol manipulating processes.