Sequential formula translation
暂无分享,去创建一个
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.
[1] F. L. Bauer. The formula-controlled logical computer “Stanislaus” , 1960 .
[2] Wesley S. Melahn. A Description of a Cooperative Venture in the Production of an Automatic Coding System , 1956, JACM.
[3] Maurice V. Wilkes,et al. Programmes for an Electronic Digital Computer , 1959 .
[4] Maurice V. Wilkes,et al. The use of a ‘floating address’ system for orders in an automatic digital computer , 1953, Mathematical Proceedings of the Cambridge Philosophical Society.