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.

The Graeffe method for finding the moduli of zeros of polynomials ~,ndLaurent series requires an expanding relative number range which imposes stringent limits on its use on an automatic computer.A revised Mgorithm, which successfully deals witil the basic problem involved, and which has additional advantages, is developed.

article Free Access Share on A Translator-Oriented Symbolic Programming Language Author: A. A. Grau Oak Ridge National Laboratory, Oak Ridge, Tennessee Oak Ridge National Laboratory, Oak Ridge, TennesseeView Profile Authors Info & Claims Journal of the ACMVolume 9Issue 4Oct. 1962 pp 480–487https://doi.org/10.1145/321138.321146Published:01 October 1962Publication History 6citation391DownloadsMetricsTotal Citations6Total Downloads391Last 12 Months15Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF