An Algorithmic Semantics for ALGOL 60 Identifier Denotation
J. M. Boyle, A. A. Grau · Journal of the ACM · 1970
The problem of giving an algorithmic specification of the semantics of identifier denotation and block structure in Algol 60 is investigated.To facilitate the statement of the algorithms, a set of "canonical identifiers" and certain auxiliary languages are introduced.The algorithms for identifier denotation are then given.They transform an Algol 60 program into one in which no identifier is ever redeclared; hence they unambiguously associate each identifier with its proper declaration.Informal proofs of the correctness of the algorithms are provided.The implications of the algorithms for resolving some of the remaining trouble spots in Algol 60, and their applicability to other languages, are briefly discussed.