SLR(K) COVERING FOR LR(K) GRAMMARS

被引：4

作者：

LEE, MJ ^{[1
]}

CHOE, KM ^{[1
]}

机构：

[1] KOREA INST SCI & TECHNOL, DEPT COMP SCI, SEOUL 130650, SOUTH KOREA

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 37卷 / 06期

关键词：

FORMAL LANGUAGES; GRAMMAR COVERING; LR(K) GRAMMAR; SLR(K) GRAMMAR;

D O I：

10.1016/0020-0190(91)90152-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We show that every LR(k) context-free grammar can be right covered by an SLR(k) grammar. We give a method of transforming an arbitrary LR(k) grammar into an SLR(k) grammar which right covers it. The transformation is based on the LR(k) parser for the given grammar.

引用

页码：337 / 347

页数：11

共 50 条

[1] COMPLETE COVERING PROBLEM FOR LR(K) GRAMMARS
MICKUNAS, MD
JOURNAL OF THE ACM, 1976, 23 (01) : 17 - 30
[2] TRANSFORMING LR(K) GRAMMARS TO LR(1), SLR(1), AND (1,1) BOUNDED RIGHT-CONTEXT GRAMMARS
MICKUNAS, MD
LANCASTER, RL
SCHNEIDER, VB
JOURNAL OF THE ACM, 1976, 23 (03) : 511 - 533
[3] ON COMPARING LL(K) AND LR(K) GRAMMARS
SOISALONSOININEN, E
MATHEMATICAL SYSTEMS THEORY, 1980, 13 (04): : 323 - 329
[4] SIMPLE LR(K) GRAMMARS
DEREMER, FL
COMMUNICATIONS OF THE ACM, 1971, 14 (07) : 453 - &
[5] ON THE RELATIONSHIP BETWEEN THE LL(K) AND LR(K) GRAMMARS
NIJHOLT, A
INFORMATION PROCESSING LETTERS, 1982, 15 (03) : 97 - 101
[6] 从LR(k)文法到SLR(k)文法
祥段
电子计算机参考资料, 1975, (07) : 37 - 58
[7] TRANSLATIONS ON A SUBCLASS OF LR(K) GRAMMARS
SOISALONSOININEN, E
BIT, 1982, 22 (03): : 303 - 312
[8] On the size of parsers and LR(k)-grammars
Leung, H
Wotschke, D
THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 59 - 69
[9] PARSING EXTENDED LR(K) GRAMMARS
PURDOM, PW
BROWN, CA
ACTA INFORMATICA, 1981, 15 (02) : 115 - 127
[10] LR(K) GRAMMARS AND DETERMINISTIC LANGUAGES
LEHMANN, D
ISRAEL JOURNAL OF MATHEMATICS, 1971, 10 (04) : 526 - &

← 1 2 3 4 5 →