An Efficient Parser for a Class of Contextual Languages

Authors:
Radu Gramatovici
Affiliations:
Faculty of Mathematics, Bucharest University, Academiei 14, R-70109, Bucureşti, Romania. e-mail address: radu@moisil.math.ro
Venue:
Fundamenta Informaticae
Year:
1998

Citing 13
Cited 0

A formal model for context-free languages augmented with reduplication

Computational Linguistics
Semantics of order-sorted specifications

Theoretical Computer Science
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
Formal and computational aspects of natural language syntax

Formal and computational aspects of natural language syntax
Contextual grammars and natural languages

Handbook of formal languages, vol. 2
On computational complexity of contextual languages

Theoretical Computer Science - Special issue: formal language theory
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Marcus Contextual Grammars

Marcus Contextual Grammars
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
A study of tree adjoining grammars

A study of tree adjoining grammars
Mathematical and computational aspects of lexicalized grammars

Mathematical and computational aspects of lexicalized grammars
Tree adjunct grammars

Journal of Computer and System Sciences
On The Computational Complexity of Marcus Contextual Languages

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of Marcus contextual languages containing non-context-free languages is defined. A parser for this class of languages is developed. The parser uses an operatorial automaton and it works in square time in the length of the input words.