A new method for determining linear precedence functions for precedence grammars
- 1 October 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (10), 567-569
- https://doi.org/10.1145/363235.363255
Abstract
The precedence relations of a precedence grammar can be precisely described by a two-dimensional precedence matrix. Often the information in the matrix can be represented more concisely by a pair of vectors, called linear precedence functions. A new algorithm is presented for obtaining the linear precedence functions when given the precedence matrix; this algorithm is shown to possess several computational adavantages.Keywords
This publication has 6 references indexed in Scilit:
- Translator writing systemsCommunications of the ACM, 1968
- EULERCommunications of the ACM, 1966
- Algorithm 265: find precedence functions [L2]Communications of the ACM, 1965
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963
- Algorithm 96: AncestorCommunications of the ACM, 1962
- A Theorem on Boolean MatricesJournal of the ACM, 1962