Research and Advances

Combining ALGOL statement analysis with validity checking

Posted

The article by Robert W. Floyd in the March 1960 issue described an algorithm for determining whether a given symbol string is a permissible ALGOL assignment statement. In his method Mr. Floyd replaces certain character pairs by single characters in an array until, in the well-formed formula, the character &Sgr; is obtained. Although this method indeed determines formation legality, one must still analyze and delimit each constituent of the statement in order to reduce the problem language to a workable format.

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More