Total Precedence Relations
- 1 January 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (1) , 14-30
- https://doi.org/10.1145/321556.321559
Abstract
A description is given of a method of syntactical analysis based on the use of precedence relations which are defined over the whole vocabulary of the context-free grammar under investigation. These relations are defined in such a way that trial-and-error is avoided whenever possible. To the same end, the customary restriction that analysis will be left-to- right is not imposed. The results are formulated in such a way that all relations can be com- puted by simple operations on Boolean matrices. This study reveals the existence of an in- teresting subset of context-free languages, which is then compared with other well-known subsets.Keywords
This publication has 6 references indexed in Scilit:
- Deterministic context free languagesInformation and Control, 1966
- EULER: A generalization of ALGOL and its formal definition: Part 1Communications of the ACM, 1966
- On the relative efficiencies of context-free grammarCommunications of the ACM, 1965
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- Report on the algorithmic language ALGOL 60Communications of the ACM, 1960