PL360, a Programming Language for the 360 Computers
Journal of the ACM (JACM)
Weak and Mixed Strategy Precedence Parsing
Journal of the ACM (JACM)
Communications of the ACM
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
Communications of the ACM
A practical method for constructing LR (k) processors
Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Domolki's algorithm applied to generalized overlap resolvable grammars
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
| Hi-index | 0.00 |
Precendece techniques have been widely used in the past in the construction of parsers. However, the restrictions imposed by them on the grammars were hard to meet. Thus, alteration of the rules of the grammar was necessary in order to make them acceptable to the parser. We have shown that, by keeping track of the possible set of rules that could be applied at any one time, one can enlarge the class of grammars considered. The possible set of rules to be considered is obtained directly from the information given by a labelled set of precedence relations. Thus, the parsers are easily obtained. Compared to the precedence parsers, this new method gives a considerable increase in the class of parsable grammars, as well as an improvement in error detection. An interesting consequence of this approach is a new decomposition technique for LR parsers.