Affiliation:
1. Harvard Univ., Cambridge, MA
2. Princeton Univ., Princeton, NJ
Abstract
Various computations on relations, Boolean matrices, or directed graphs, such as the computation of precedence relations for a context-free grammar, can be done by a practical algorithm that is asymptotically faster than those in common use. For example, how to compute operator precedence or Wirth-Weber precedence relations in O(n
2
) steps is shown, as well as how to compute linear precedence functions in O(n) steps, where n is the size of a grammar. The heart of the algorithms is a general theorem giving sufficient conditions under which an expression whose operands are sparse relations and whose operators are composition, transitive closure, union, and inverse, can be computed efficiently.
Publisher
Association for Computing Machinery (ACM)
Reference13 articles.
1. Aho A.V. and Ullman J.D. The Theory of Parsing Translation and Compiling. Prentice Hall Englewood Cliffs N.J. 1972 and 1973. Aho A.V. and Ullman J.D. The Theory of Parsing Translation and Compiling. Prentice Hall Englewood Cliffs N.J. 1972 and 1973.
2. A new method for determining linear precedence functions for precedence grammars
3. Simple
LR(k)
grammars
4. Syntactic Analysis and Operator Precedence
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献