Parsing local internal contextual languages with context-free choice

被引：0

作者：

Gramatovici, R ^{[1
]}

Manea, F ^{[1
]}

机构：

[1] Univ Bucharest, Fac Math & Comp Sci, Bucharest 010014, Romania

来源：

FUNDAMENTA INFORMATICAE | 2005年 / 64卷 / 1-4期

关键词：

contextual grammar; parsing; polynomial complexity;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We extend the result from [8] by giving also a concrete polynomial parsing algorithm for a class of languages generated by a variant of contextual grammars, namely local internal contextual grammars with context-free choice.

引用

页码：171 / 183

页数：13

共 15 条

[1] [Anonymous], 1997, HDB FORMAL LANGUAGES, DOI DOI 10.1007/978-3-662-07675-0
[2] AN EFFICIENT CONTEXT-FREE PARSING ALGORITHM
EARLEY, J
[J]. COMMUNICATIONS OF THE ACM, 1970, 13 (02) : 94 - &
[3] Gramatovici R., 1998, Fundamenta Informaticae, V33, P211
[4] GRAMATOVICI R, IN PRESS APPL MEMBRA
[5] Gramatovici R., 2003, P 3 INT AMAST WORKSH, P99
[6] Harbusch K, 2003, LECT NOTES COMPUT SC, V2588, P168
[7] HARBUSCH K, 1999, P MOL6 6 M MATH LANG, P323
[8] HARBUSCH K, 2003, GRAMMARS AUTOMATA ST, P45
[9] Ilie L., 1997, Fundamenta Informaticae, V30, P161
[10] On computational complexity of contextual languages
Ilie, L
[J]. THEORETICAL COMPUTER SCIENCE, 1997, 183 (01) : 33 - 44

← 1 2 →