Generalized deterministic left to right parsing


A parser model is presented whose structure is a generalization of the well known LR(k) parsers. Various classes of this parser that would be both practical and efficient to use in a compiler are examined. Associated with these classes of parsers is a hierarchy of type-0 grammars, each grammatical class being defined in terms of the form and structure of… (More)
DOI: 10.1007/BF00264578


2 Figures and Tables