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 条

[1] Lookahead LR parsing with regular right part grammars
Colby, JE
Bermudez, ME
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1997, 64 (1-2) : 1 - 15
[2] PARSING REGULAR GRAMMARS WITH FINITE LOOKAHEAD
OSTRAND, TJ
PAULL, MC
WEYUKER, EJ
ACTA INFORMATICA, 1981, 16 (02) : 125 - 138
[3] CONSTRUCTING LR-PARSERS FOR REGULAR RIGHT PART GRAMMARS
LALONDE, WR
ACTA INFORMATICA, 1979, 11 (02) : 177 - 193
[4] A SIMPLE REALIZATION OF LR-PARSERS FOR REGULAR RIGHT PART GRAMMARS
SASSA, M
NAKATA, I
INFORMATION PROCESSING LETTERS, 1987, 24 (02) : 113 - 120
[5] THE CONSTRUCTION OF STACK-CONTROLLING LR PARSERS FOR REGULAR RIGHT PART GRAMMARS
LALONDE, WR
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1981, 3 (02): : 168 - 206
[6] PRACTICAL ARBITRARY LOOKAHEAD LR PARSING
BERMUDEZ, ME
SCHIMPF, KM
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 41 (02) : 230 - 250
[7] A UNIFYING MODEL FOR LOOKAHEAD LR PARSING
BERMUDEZ, ME
COMPUTER LANGUAGES, 1991, 16 (02): : 167 - 178
[8] LR parsing for conjunctive grammars
Okhotin, Alexander
Grammars, 2002, 5 (02): : 81 - 124
[9] LR parsing for Boolean grammars
Okhotin, A
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 362 - 373
[10] LR PARSING FOR AFFIX GRAMMARS
POHLMANN, W
ACTA INFORMATICA, 1983, 20 (04) : 283 - 300

← 1 2 3 4 5 →