ACM Home Page
Please provide us with feedback. Feedback
An error-correcting parse algorithm
Full text PdfPdf (585 KB)
Source
Communications of the ACM archive
Volume 6 ,  Issue 11  (November 1963) table of contents
Pages: 669 - 673  
Year of Publication: 1963
ISSN:0001-0782
Author
E. T. Irons  Institute for Defense Analysis, Princeton, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 36,   Citation Count: 23
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/368310.368385
What is a DOI?

ABSTRACT

During the past few years, research into so-called “Syntax Directed Compiler” and “Compiler Compiler” techniques [1, 2, 3, 4, 5, 6] has given hope that constructing computer programs for translating formal languages may not be as formidable a task as it once was. However, the glow of the researchers' glee has obscured to a certain extent some very perplexing problems in constructing practical translators for common programming languages. The automatic parsing algorithms indeed simplify compiler construction but contribute little to the production of “optimized” machine code, for example. An equally perplexing problem for many of these parsing algorithms has been what to do about syntactically incorrect object strings. It is common knowledge that most of the ALGOL or FORTRAN “programs” which a compiler sees are syntactically incorrect. All of the parsing algorithms detect the existence of such errors. Many have considerable difficulty pinpointing the location of the error, printing out diagnostic information, and recovering enough to move on to other correct parts of the object string. It is the author's opinion that those algorithms which do the best job of error recovery are those which are restricted to simpler forms of formal languages.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
---- Towards more versatile mechanical translators. To be published.
 
3
---- The structure and use of the syntax directed compiler. Ann. Rev. in Autom. Programming, 3, 207-228.
 
4
PAUL,, M. A General Processor for Certain Formal Languages. Symbol Languages in Data Processing. Gordon and Breach, London 1962, 65-74.
 
5
EICKEL, J., PAUL, M., BAUER, F. L., SAMUELSON, K. A syntax controlled generator of formal language processor. Institut ffir Angew. Mat. der Univ. Mainz. Sept., 1962.
 
6
BROOKER, R. A., MACCALLUM, I., MORRIS, D., ROHL, J. S. The compiler compiler. Ann. Rev. Autom. Programming 3, 229-271.
 
7
BACKUS, J. W. The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conf. Proc. Intemat. Conf. Inform. Process., UNESCO, (June 1959), 125-132.
8

CITED BY  23