Parsing non-LR(k) grammars with yacc

被引：0

|

作者：

Merrill, Gary H. ^{[1
]}

机构：

[1] SAS Inst Inc, Cary, United States

来源：

Software - Practice and Experience | 1993年 / 23卷 / 08期

关键词：

Computational grammars;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：829 / 850

相关论文

共 50 条

[21] SLR(K) COVERING FOR LR(K) GRAMMARS
LEE, MJ
CHOE, KM
INFORMATION PROCESSING LETTERS, 1991, 37 (06) : 337 - 347
[22] ON COMPARING LL(K) AND LR(K) GRAMMARS
SOISALONSOININEN, E
MATHEMATICAL SYSTEMS THEORY, 1980, 13 (04): : 323 - 329
[23] TRANSLATIONS ON A SUBCLASS OF LR(K) GRAMMARS
SOISALONSOININEN, E
BIT, 1982, 22 (03): : 303 - 312
[24] On the size of parsers and LR(k)-grammars
Leung, H
Wotschke, D
THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 59 - 69
[25] LR(K) GRAMMARS AND DETERMINISTIC LANGUAGES
LEHMANN, D
ISRAEL JOURNAL OF MATHEMATICS, 1971, 10 (04) : 526 - &
[26] Characterization of extended LR(k) grammars
Lee, GO
Kim, DH
INFORMATION PROCESSING LETTERS, 1997, 64 (02) : 75 - 82
[27] BOUNDEDLY LR(K)-CONFLICTABLE GRAMMARS
LEE, MJ
CHOE, KM
ACTA INFORMATICA, 1994, 31 (03) : 261 - 283
[28] Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
Barash, Mikhail
Okhotin, Alexander
THEORY OF COMPUTING SYSTEMS, 2017, 61 (02) : 581 - 605
[29] Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
Mikhail Barash
Alexander Okhotin
Theory of Computing Systems, 2017, 61 : 581 - 605
[30] ON THE RELATIONSHIP BETWEEN THE LL(K) AND LR(K) GRAMMARS
NIJHOLT, A
INFORMATION PROCESSING LETTERS, 1982, 15 (03) : 97 - 101

← 1 2 3 4 5 →