Thumbnail
Access Restriction
Subscribed

Author Samelson, K. ♦ Bauer, F. L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state-symbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation.
Description Affiliation: Johannes Gutenberg Univ., Mainz, Germany (Samelson, K.; Bauer, F. L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 3
Issue Number 2
Page Count 8
Starting Page 76
Ending Page 83


Open content in new tab

   Open content in new tab
Source: ACM Digital Library