EULER: a generalization of ALGOL, and its formal definition: Part II

@article{Wirth1966EULERAG,
  title={EULER: a generalization of ALGOL, and its formal definition: Part II},
  author={Niklaus Wirth and Helmut Weber},
  journal={Commun. ACM},
  year={1966},
  volume={9},
  pages={89-99}
}
In this section the algorithmic language EULER is described first informally and then formally by its syntax and semantics. An attempt has been made to generalize and extend some of the concepts of ALGOL, thus creating a language which is simpler and yet more flexible than ALGOL 60. A second objective in developing this language was to show that a useful programming language which can be processed with reasonable efficiency can be defined in rigorous formality. 

Tables from this paper

A graph theory oriented extension to Algol
TLDR
The graphic language has been defined by an operators precedence grammar, written in Backus normal form, so that a syntax directed compiler can be used.
Applications of language theory to compiler design
  • J. Ullman
  • Computer Science
    AFIPS '72 (Spring)
  • 1971
There are certain aspects of language theory that have had, or can have, significant impact on the design and implementation of compilers. These areas are, principally, the subjects of context free
A language extension for graph processing and its formal semantics
A simple programming language “extension,” Graspe, for processing directed graphs is defined. Graspe consists of a type of directed graph data structure and a set of primitive operations for
A semantic extension of BNF
TLDR
The language allows a syntactic and semantic definition of the language being described, and is an extension of standard BNF, and applies it to describe a dialect of FORTRAN II.
Formal languages: Origins and directions
  • S. Greibach
  • Computer Science
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
TLDR
It is observed that the same important ideas emerged independently for the automatic analysis and translation of both natural and artificial languages in the 1950s and early 1960s.
An Algorithm for the Design of Simple Precedence Grammars
A practical incremental algorithm for transforming an arbitrary context-free grammar into an equivalent grammar with unique precedence relations between any two symbols in its vocabulary is
Generalized Overlap Resolvable Grammars and Their Parsers
Derived semantics for some programming language constructs
TLDR
During the course of constructing the proof, formal definitions of the concepts of value and side-effect are derived in order to make the proof rigorous.
An Algorithmic Semantics for ALGOL 60 Identifier Denotation
TLDR
The algorithms for identifier denotation transform an Algol 60 program into one in which no identifier is ever redeclared; hence they unambiguously associate each identifier with its proper declaration.
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Correspondence between ALGOL 60 and Church's Lambda-notation
TLDR
A model for computer languages and computer behavior is described, based on the notions of functional application and functional abstraction, but also having analogues for imperative language features.
The Mechanical Evaluation of Expressions
TLDR
It is shown how some forms of expression in current programming languages can be modelled in Church's X-notation, and a way of "interpreting" such expressions is described, which suggests a method of analyzing the things computer users write.
The Syntax of Programming Languages-A Survey
  • R. W. Floyd
  • Computer Science, Linguistics
    IEEE Trans. Electron. Comput.
  • 1964
TLDR
The syntactic rules for many programming languages have been expressed by formal grammars, generally variants of phrase-structure grammar, but major problems remain in rendering analyzers efficient in use of space and time and in finding fully satisfactory formal Grammars for present and future programming languages.
A Descriptive Language for Symbol Manipulation
TLDR
It will be the purpose of this paper to present a more suitable notation for description of compilers and other complicated symbol manipulation algorithms.
“Structural connections” in formal languages
  • E. Irons
  • Computer Science, Linguistics
    CACM
  • 1964
This paper defines the concept of “structural connection” in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in
Report on the algorithmic language ALGOL 60
TLDR
It was decided to hold an international meeting in January 1960 for improving the ALGOL language and preparing a final report, and seven representatives were selected to attend the January 1960 international conference.
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.
The calculi of lambda-conversion
The description for this book, The Calculi of Lambda Conversion. (AM-6), will be forthcoming.
The definition of programming languages by their compiler', IFIP Working Conf
  • The definition of programming languages by their compiler', IFIP Working Conf
  • 1964
The CUCH a s a formal and descriptive language', IFIP Working Conf
  • The CUCH a s a formal and descriptive language', IFIP Working Conf
  • 1964
...
...