Linear precedence functions for weak precedence grammars

Publisher Website
Google Scholar
Abstract
Linear precedence functions can be used to compress the information of certain precedence matrices. While saving space, the method applied to Wirth-Weber precedence matrices causes the detection of errors to be occasionally delayed. When shift-reduce decisions are based on a weak precedence grammar, however, it is often possible to find linear pre-cedence functions which preserve some of the error checking capability of the matrix. While the maximization of the amount of error checking is a large combinatorial problem, algorithms to reduce the search time can be given.