ACM

Communications of the ACM

Home/Magazine Archive/January 1974 (Vol. 17, No. 1)/Syntax-directed least-errors analysis for context-free.../Abstract

Syntax-directed least-errors analysis for context-free languages: a practical approach

By Gordon Lyon
Communications of the ACM, January 1974, Vol. 17 No. 1, Pages 3-14
10.1145/360767.360771
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of context-free grammars as drivers, and any finite string as input. Recognition consists of a least-errors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

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.