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

  • Authors:
  • Niklaus Wirth;Helmut Weber

  • Affiliations:
  • Stanford Univ., Stanford, CA;Stanford Univ., Stanford, CA

  • Venue:
  • Communications of the ACM
  • Year:
  • 1966

Quantified Score

Hi-index 48.45

Visualization

Abstract

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.