By Paul McIsaac
Communications of the ACM,
July 1960,
Vol. 3 No. 7, Pages 418-419
10.1145/367349.367360
Comments
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.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
