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 条
  • [31] K-COVERING MAPPINGS
    OSTROVSKII, AV
    DOKLADY AKADEMII NAUK SSSR, 1976, 227 (06): : 1297 - 1300
  • [32] Exact minimum codegree thresholds for K4--covering and K5--covering
    Yu, Lei
    Hou, Xinmin
    Ma, Yue
    Liu, Boyuan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (03): : 1 - 8
  • [33] Smallest Square Covering k Points for Large Value of k
    Mahapatra, Priya Ranjan Sinha
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, 2015, 339 : 337 - 342
  • [34] LR parsing for conjunctive grammars
    Okhotin, Alexander
    Grammars, 2002, 5 (02): : 81 - 124
  • [35] OPTIMIZATION OF LR(K) REDUCED PARSERS
    ANCONA, M
    FASSINO, C
    GIANUZZI, V
    INFORMATION PROCESSING LETTERS, 1992, 41 (01) : 13 - 20
  • [36] LR parsing for Boolean grammars
    Okhotin, A
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 362 - 373
  • [37] LR PARSING FOR AFFIX GRAMMARS
    POHLMANN, W
    ACTA INFORMATICA, 1983, 20 (04) : 283 - 300
  • [38] SEMANTIC ROUTINES AND LR(K) PARSERS
    PURDOM, P
    BROWN, CA
    ACTA INFORMATICA, 1980, 14 (04) : 299 - 315
  • [39] LR(k)语法的特征
    韩光辉
    武汉汽车工业大学学报, 2000, (05) : 34 - 36
  • [40] On LR(k)-Parsers of Polynomial Size
    Blum, Norbert
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 163 - 174
12345