Algorithm 105: Newton Maehly

1962

A syntax controlled generator of formal language processors

1963

Some inequalities involving the euclidean condition of a matrix

1960

Absolute and monotonic norms

1961

Algorithm 153: gomory

1963

Sequential formula translation

1983

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- s ymbol 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.