Can I read Strict Deterministic Versus LR(0) Parsing (Extended Abstract) on EtoBox?

Strict Deterministic Versus LR(0) Parsing (Extended Abstract) by M. Geller and M. Harrison is a scholarly article available to read on EtoBox.

What is Strict Deterministic Versus LR(0) Parsing (Extended Abstract) about?

Extended Abstract Recently strict deterministic grammars and languages have been introduced [9,10,11]. This family of languages is quite fundamental in the study of the mathematical properties of deterministic languages and in dealing with some classical families of grammars such as LR(k) and bounded right context grammars [7,8,14]. These grammars are closely related to LR(0) grammars [1,12,13,14],in fact each strict deterministic grammar is also LR(0). In the present paper,we consider the question of how to parse strict deterministic grammars. We introduce part of a more general theory called "characteristic LR(k) parsing". This actually produces parsers which are tuned to the characteristics of a particular family of grammars. We apply the theory to the family of strict deterministic grammars and we get parsers which are as fast as canonical LR(k) parsers but are substantially smaller. They are not necessarily minimal but we postpone any discussion of minimality to the sequel. The techniques used in the present discussion are quite general [5]. For instance. the study in [3] is similar in spirit to our technique. The optimization techniques for LR(k) parsers in [2] do not work in

Author

M. Geller and M. Harrison