Affiliation:
1. Digital Equipment Corp., Maynard, MA
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic epistemic logic in update logic;Journal of Logic and Computation;2016-03-07
2. Towards a Unified View of Modeling and Programming;Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications;2016
3. A conceptual and formal model of a diagnostic reasoner;Advances in Knowledge Acquisition;1996
4. Reasoning about update logic;Journal of Philosophical Logic;1995-02
5. A proof system for the language POOL;Foundations of Object-Oriented Languages;1991