An algorithm defining ALGOL assignment statements

ABSTRACT

It is not possible, by testing symbol pairs only [2], to determine whether a given symbol string is consistent with the formation rules of ALGOL [1]. For example, the formula l1: l2: x[i := 5j + 3.14.159; violates four distinct formation rules of ALGOL, yet each pair of adjacent characters may appear in permissible formulae. The algorithm described here will determine, with minor restrictions, whether a particular symbol string is a permissible ALGOL assignment statement. I believe that the same technique may be extended to determine whether a given symbol string is a permissible ALGOL program or not, where a program is defined as a sequence of permissible statements separated by semicolons. The algorithm scans the formula from left to right, replacing certain character pairs by single characters. If under the allowable transformations the symbol string may be reduced to the single character &Sgr;, it is a well-formed formula in ALGOL; otherwise it violates the formation rules.

REFERENCES

• 1: A. J. Perlis , K. Samelson, Preliminary report: international algebraic language, Communications of the ACM, v.1 n.12, p.8-22, Dec. 1958 [doi>10.1145/377924.594925]
• 2: Communications of Ihe ACM 2 (April 1959), 10-11.
• 3: Harvy Bratman , Julien Green , John Stockman , Albert R. Watson, Recommendations of the SHARE ALGOL Committee, Communications of the ACM, v.2 n.10, p.25-26, Oct. 1959 [doi>10.1145/368453.1127875]