Transformation from an unrestricted LR(k) grammar into an unrestricted LR(1) grammar

被引：0

作者：

Kobayashi, Nobuyuki ^{[1
]}

Shiina, Hiromitsu ^{[2
]}

Masuyama, Sigeru ^{[3
]}

机构：

[1] Sanyo Gakuen Univ, Okayama 7038501, Japan

[2] Okayama Univ Sci, Okayama 7000005, Japan

[3] Toyohashi Univ Technol Knowledge Based Informat E, Toyohashi, Aichi, Japan

来源：

INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL | 2008年 / 11卷 / 02期

关键词：

Formal languages; Parsing; LR(k) grammar; Unrestricted LR(k) grammar;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper, we define the unrestricted LR(k) grammar and show that any phrase structure grammar G can be transformed into an unrestricted LR(1) grammar which generates the same language generated by G.

引用

页码：215 / 227

页数：13

共 9 条

[1] Aho Alfred V., 1986, ADDISON WESLEY SERIE
[2] GRUNE D, 1990, PARSING TECHNIQUES
[3] Harris L. A., 1987, ACTA INFORM, V24, P191
[4] PARSING FOR GENERAL PHRASE-STRUCTURE GRAMMARS
LOECKX, J
[J]. INFORMATION AND CONTROL, 1970, 16 (05): : 443 - &
[5] Shiina H., 2000, IEICE
[6] Shiina H., 1997, MATH JPN, V46, P129
[7] Sippu S., 1990, PARSING THEORY, VII
[8] VOLDMAN GS, 1981, PROGRAM COMPUT SOFT+, V7, P302
[9] DETERMINISTIC CONTEXT-SENSITIVE LANGUAGES .1
WALTERS, DA
[J]. INFORMATION AND CONTROL, 1970, 17 (01): : 14 - &

← 1 →