Canonical Precedence Schemes
- 1 April 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 20 (2) , 214-234
- https://doi.org/10.1145/321752.321755
Abstract
A general theory of canonical precedence analysis is defined and studied. The familiar types of precedence analysis such as operator precedence or simple precedence occur as special cases of this theory. Among the theoretical results obtained are a characterization of the structure of precedence relations and the relation of canonical precedence schemes to operator sets.Keywords
This publication has 8 references indexed in Scilit:
- On the Covering and Reduction Problems for Context-Free GrammarsJournal of the ACM, 1972
- One-way nondeterministic real-time list-storage languagesJournal of the ACM, 1968
- Translator writing systemsCommunications of the ACM, 1968
- EULERCommunications of the ACM, 1966
- On the translation of languages from left to rightInformation and Control, 1965
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965
- Bounded context syntactic analysisCommunications of the ACM, 1964
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963