Lookahead LR parsing with regular right part grammars

被引：0

|

作者：

Univ of California, Santa Cruz, United States ^{[1
]}

机构：

来源：

Int J Comput Math | / 1-2卷 / 1-15期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[21] Yet another generation of LALR parsers for regular right part grammars
Morimoto, S
Sassa, M
ACTA INFORMATICA, 2001, 37 (09) : 671 - 697
[22] New parsing method for non-LR(1) grammars
Harford, A.Gayler
Heuring, Vincent P.
Main, Michael G.
Software - Practice and Experience, 1992, 22 (05) : 419 - 437
[23] Fast LR parsing using rich (tree adjoining) grammars
Prolo, CA
PROCEEDINGS OF THE 2002 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING, 2002, : 103 - 110
[24] AN IMPROVED LALR(K) PARSER GENERATION FOR REGULAR RIGHT PART GRAMMARS
SHIN, HC
CHOE, KM
INFORMATION PROCESSING LETTERS, 1993, 47 (03) : 123 - 129
[25] Yet another generation of LALR parsers for regular right part grammars
Shin-ichi Morimoto
Masataka Sassa
Acta Informatica, 2001, 37 : 671 - 697
[26] AN LR PARSING TECHNIQUE FOR EXTENDED CONTEXT-FREE GRAMMARS
CELENTANO, A
COMPUTER LANGUAGES, 1981, 6 (02): : 95 - 107
[27] A NEW PARSING METHOD FOR NON-LR(1) GRAMMARS
HARFORD, AG
HEURING, VP
MAIN, MG
SOFTWARE-PRACTICE & EXPERIENCE, 1992, 22 (05): : 419 - 437
[28] THE EQUIVALENCE PROBLEM FOR LL-REGULAR AND LR-REGULAR GRAMMARS
NIJHOLT, A
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (02) : 149 - 161
[29] LALR(1,1) PARSER GENERATION FOR REGULAR RIGHT PART GRAMMARS
CHAPMAN, NP
ACTA INFORMATICA, 1984, 21 (01) : 29 - 45
[30] Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
Barash, Mikhail
Okhotin, Alexander
THEORY OF COMPUTING SYSTEMS, 2017, 61 (02) : 581 - 605

← 1 2 3 4 5 →