• Corpus ID: 44764020

The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference

  title={The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference},
  author={John Warner Backus},
  booktitle={IFIP Congress},
  • J. Backus
  • Published in IFIP Congress 1959
  • Computer Science
This paper gives a summary of the syntax and interpretation rules of the proposed international algebraic language put forward by the Zurich ACM-GAMM Conference, followed by a formal , complete presentation of the same information. Notations are presented for numbers, numerical variables, Boolean variables , relations, n-dimensional arrays, functions, operators and algebraic expressions. Means are provided in the language for the assignment of values to variables, conditional execution of… 
A nonrecursive method of syntax specification
The use of the Kleene regular expression notation for describing algebraic language syntax, in particular of ALGOL, is described in this paper, expressing the Revised AlGOL 1960 syntax in completely nonrecursive terms, as far as its context-free portion is concerned.
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.
An Algorithmic Semantics for ALGOL 60 Identifier Denotation
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.
A Family of Syntax Deenition Formalisms
Starting with a small kernel, various features for syntax de-nition are designed orthogonally to each other, providing a framework for constructing new formalisms by adapting and extending old ones.
User Defined Syntax
This thesis describes two examples of user defined syntax, one of which is a new datatype construction, the conctype, the elements of which have a very flexible syntax and another is user defined distfix operators which give a user possibility to extend the syntax for expressions in a programming language.
An Introduction to Procedure-Oriented Languages
A Family of Syntax Definition Formalisms
This chapter provides an introduction to SDF2 and gives an overview of the design and speciication of the family of formalisms, which include uniform deenition of lexical and context-free syntax, variables, disambiguation by priorities, follow restrictions and reject productions.
Programming languages for non-numeric processing—2: An introduction to the COGENT programming system
The COGENT (COmpiler and GENeralized Translator) programming system is a compiler whose input language is designed to describe symbolic or linguistic manipulation algorithms, and is also applicable to such problem areas as algebraic manipulation, mechanical theorem-proving, and heuristic programming.
A compiler—compiler system
To the author's knowledge three other operational compiler-compiler systems, whose strategy is similar to the scheme documented here, have been developed. The Feldman system [6, 7, 8] is a bounded
Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context
The main challenges in providing formal semantics for imperative programming languages are identified and the responses to these challenges are reviewed in four relatively complete formal descriptions of ALGOL 60.


Preliminary report: international algebraic language
This appears to be a natural method for a 256 memory machine, if it had good indexing and looping features and the contribution of the left-hand term becomes proportionately large enough such that it alone might be used within accuracy limits after a certain number of digits are developed.