TRANSFORMING LR(K) GRAMMARS TO LR(1), SLR(1), AND (1,1) BOUNDED RIGHT-CONTEXT GRAMMARS

被引：10

作者：

MICKUNAS, MD

LANCASTER, RL

SCHNEIDER, VB

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,DIGITAL COMP LAB,URBANA,IL 61801

[2] BOWLING GREEN STATE UNIV,DEPT COMP SCI,BOWLING GREEN,OH

[3] PURDUE UNIV,DEPT COMP SCI,W LAFAYETTE,IN 47907

来源：

JOURNAL OF THE ACM | 1976年 / 23卷 / 03期

关键词：

D O I：

10.1145/321958.321972

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：511 / 533

页数：23

共 27 条

[1]

Aho A. V., 1973, THEORY PARSING TRANS, VII

[2] WEAK AND MIXED STRATEGY PRECEDENCE PARSING [J].

AHO, AV ;

ULLMAN, JD ;

DENNING, PJ .

JOURNAL OF THE ACM, 1972, 19 (02) :225-&

[3] SIMPLE LR(K) GRAMMARS [J].

DEREMER, FL .

COMMUNICATIONS OF THE ACM, 1971, 14 (07) :453-&

[4]

DeRemer Frank, 1969, THESIS MIT

[5] SYNTACTIC ANALYSIS AND OPERATOR PRECEDENCE [J].

FLOYD, RW .

JOURNAL OF THE ACM, 1963, 10 (03) :316-&

[6] BOUNDED CONTEXT SYNTACTIC ANALYSIS [J].

FLOYD, RW .

COMMUNICATIONS OF THE ACM, 1964, 7 (02) :62-67

[7]

Geller M. M., 1973, 14th Annual Symposium on Switching Automata Theory, P103, DOI 10.1109/SWAT.1973.3

[8] DETERMINISTIC CONTEXT FREE LANGUAGES [J].

GINSBURG, S ;

GREIBACH, S .

INFORMATION AND CONTROL, 1966, 9 (06) :620-&

[9]

GRAHAM S, 1971, THESIS STANFORD U

[10]

Graham S. L., 1974, SIAM Journal on Computing, V3, P224, DOI 10.1137/0203019

← 1 2 3 →