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