Parsing Local Internal Contextual Languages with Context-Free Choice

Authors:
Radu Gramatovici;Florin Manea
Affiliations:
(Correspd.) Faculty of Mathematics and Computer Science, Bucharest University, Academiei 14, 010014 Bucureşti, Romania. {radu,flmanea}@funinf.cs.unibuc.ro;Faculty of Mathematics and Computer Science, Bucharest University, Academiei 14, 010014 Bucureşti, Romania. {radu,flmanea}@funinf.cs.unibuc.ro
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2005

Citing 8
Cited 0

On the computational complexity of Marcus contextual languages

Fundamenta Informaticae
Contextual grammars and natural languages

Handbook of formal languages, vol. 2
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
On computational complexity of contextual languages

Theoretical Computer Science - Special issue: formal language theory
An efficient parser for a class of contextual languages

Fundamenta Informaticae - Special issue on grammar systems
An efficient context-free parsing algorithm

Communications of the ACM
Marcus Contextual Grammars

Marcus Contextual Grammars
An efficient online parser for contextual grammars with at most context-free selectors

CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.