On deterministic canonical bottom-up-parsing

A general framework for producing deterministic canonical bottom-up parsers which contains all these parsers as special cases is described. Then general conditions on the means of construction which guarantee that the obtained parsing methods work correctly are presented. These conditions cover all types of deterministic canonical bottom-up parsers. Based on these conditions a strategy that constructs an optimally adjusted bottom-up parser for a given grammar is discussed