Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
A syntax directed compiler for ALGOL 60
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
Continued operation notation for symbol manipulation and array processing
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
A general-purpose table-driven compiler
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Universal programming languages and processors: a brief survey and new concepts
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
The introduction of definitional facilities into higher level programming languages
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
The design and implementation of a table driven compiler system
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
A formal system for the specification of the syntax and translation of computer languages
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
A system for interactive graphical programming
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A syntax-directed approach to pattern recognition and description
AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
The implementation of the PROPHET system
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 0.00 |
This paper is primarily concerned with the analysis of source statements in a programming language, although some of the ideas and techniques may be applicable to the analysis of source statements in a natural language. We are particularly concerned with those techniques which might be classed as predictive; the companion paper by Graham is concerned with other ("nonpredictive") techniques of analysis. Very broadly the techniques we will discuss operate as follows: Given a set of rules (Syntax Specification) for forming allowable constructs, eventually resulting in a statement (or sentence, word, program, etc.) of a language, we analyze a source statement in that language by guessing, or predicting, how the statement is constructed and either verifying that this is the case or backing up to try again, assuming some other method of construction. We keep a "history" of our attempts and when we have determined the exact way in which the statement is constructed we can use this "history" of its construction for further processing of the components of the statement.