Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
A practical method for constructing LR (k) processors
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
“Structural connections” in formal languages
Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
A syntax controlled generator of formal language processors
Communications of the ACM
Report on the algorithmic language ALGOL 68
Report on the algorithmic language ALGOL 68
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 48.22 |
An algorithm is described which accepts an arbitrary context-free grammar and constructs a bounded-context parser for it whenever such a parser exists.In the first part of the paper the definition of a context-free grammar and the working of a bounded-context parser are recalled. The notion of reduction class for a context-free grammar is then introduced and its connection with the structure of a bounded-context parser is indicated. Next, pushdown automata which generate the different reduction classes of a context-free grammar are defined. Finally, the algorithm is described; it essentially carries out an exhaustive study of all possible runs of the pushdown automata generating the reduction classes.In the second part, the utility of the algorithm is discussed in the light of the experience gained from its use in compiler design. The algorithm is claimed to be particularly useful in the simultaneous design of a language and a compiler for it.