论文信息 - Precedence-regular grammars

Precedence-regular grammars

A new class of grammars (precedence-regular grammars) is obtained as a proper extension of the class of weak precedence grammars. A parsing algorithm is described for this class of grammars, using Domolki's algorithm. Finally a criterion is obtained to decide whether a given context-free grammar belongs to this class.

R. K. Shyamasundar | R. Shyamasundar

[1] Karel Culik,et al. LR-Regular Grammars - an Extension of LR(k) Grammars , 1973, J. Comput. Syst. Sci..

[2] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[3] R. K. Shyamasundar. Precedence parsing using domolki's algorithm , 1977 .

[4] Jim Gray,et al. On the Covering and Reduction Problems for Context-Free Grammars , 1972, JACM.

[5] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[6] Jim Gray,et al. Canonical Precedence Schemes , 1973, JACM.

[7] Jan B. Hext,et al. Syntax Analysis by Domölki's Algorithm , 1970, Comput. J..

[8] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..

[9] Michael J. Fischer. Some properties of precedence languages , 1969, STOC '69.