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.

CACM February, 1960

Samelson, K.
Bauer, F. L.

CA600208 JB March 22, 1978  2:17 PM

224	4	224
364	4	224
1139	5	224
1141	5	224
1215	5	224
1223	5	224
224	5	224
224	5	224
224	5	224
267	5	224
1647	5	224
1781	5	224
1787	5	224
1792	5	224
364	5	224
405	5	224
438	5	224
98	5	224
763	5	224
100	6	224
123	6	224
196	6	224
196	6	224
196	6	224
919	6	224
990	6	224
1007	6	224
1025	6	224
1046	6	224
1131	6	224
1139	6	224
1140	6	224
1141	6	224
1149	6	224
1179	6	224
1198	6	224
1215	6	224
1215	6	224
1223	6	224
1265	6	224
1303	6	224
1323	6	224
1358	6	224
1366	6	224
1421	6	224
1460	6	224
1462	6	224
1463	6	224
1467	6	224
1468	6	224
1477	6	224
1491	6	224
1491	6	224
1496	6	224
1496	6	224
1531	6	224
1535	6	224
1565	6	224
1601	6	224
1602	6	224
1605	6	224
1613	6	224
1614	6	224
1626	6	224
1641	6	224
1781	6	224
1787	6	224
1788	6	224
205	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
224	6	224
249	6	224
249	6	224
288	6	224
303	6	224
316	6	224
381	6	224
398	6	224
399	6	224
11	6	224
44	6	224
55	6	224
77	6	224
77	6	224
77	6	224
77	6	224
93	6	224
98	6	224
404	6	224
404	6	224
404	6	224
405	6	224
410	6	224
412	6	224
438	6	224
463	6	224
464	6	224
464	6	224
483	6	224
3184	6	224
3188	6	224
584	6	224
600	6	224
631	6	224
631	6	224
680	6	224
691	6	224
763	6	224
763	6	224
763	6	224
799	6	224
799	6	224