A new method for determining linear precedence functions for precedence grammars

Authors:
James R. Bell
Affiliations:
Digital Equipment Corp., Maynard, MA
Venue:
Communications of the ACM
Year:
1969

Citing 6
Cited 4

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Translator writing systems

Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II

Communications of the ACM
Algorithm 265: find precedence functions [L2]

Communications of the ACM
Algorithm 96: Ancestor

Communications of the ACM

Weak and Mixed Strategy Precedence Parsing

Journal of the ACM (JACM)
Operations on sparse relations

Communications of the ACM
The storage requirement in precedence parsing

Communications of the ACM
A Boolean matrix method for the computation of linear precedence functions

Communications of the ACM

Quantified Score

Hi-index	48.26

Visualization

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.