Conjunctive Grammars 1

نویسنده

  • Alexander Okhotin
چکیده

This paper introduces a class of formal grammars made up by augmenting the formalism of context-free grammars with an explicit set-theoretic intersection operation. It is shown that conjunctive grammars can generate some important non-context-free language constructs, including those not in the intersection closure of context-free languages, and that they can provide very succinct descriptions of some context-free languages and nite intersections of context-free languages. On the other hand, it is proved that conjunctive grammars can still be parsed in cubic time and that the notion of the derivation tree is retained, which gives reasonable hope for their practical applicability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjunctive Grammars Can Generate Non-regular Unary Languages

Conjunctive grammars were introduced by A. Okhotin in [1] as a natural extension of context-free grammars with an additional operation of intersection in the body of any production of the grammar. Several theorems and algorithms for context-free grammars generalize to the conjunctive case. Still some questions remained open. A. Okhotin posed nine problems concerning those grammars. One of them ...

متن کامل

Formal grammars Lectures ??–??. Linear grammars and trellis automata

The linear case of context-free, conjunctive and Boolean grammars. Trellis automata. Examples. Equivalence of grammars and automata. 1 Linear Boolean grammars Definition 1. A Boolean grammar G = (Σ, N, P, S) is said to be linear if every rule A→ α1& . . .&αm&¬β1& . . .&¬βn, has αi, βj ∈ Σ∗ ∪ (Σ ∪N)∗. If a linear Boolean grammar is conjunctive (context-free), it is called a linear conjunctive (l...

متن کامل

Conjunctive Categorial Grammars

Basic categorial grammars are enriched with a conjunction operation, and it is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that is, context-free grammars enhanced with conjunction. It is also shown that categorial grammars with conjunction can be naturally embedded into the Lambek calculus with conjunction and disjunction operations. Thi...

متن کامل

Conjunctive Grammars

This paper introduces a class of formal grammars made up by augmenting the formalism of context-free grammars with an explicit set-theoretic intersection operation. It is shown that conjunctive grammars can generate some important non-contextfree language constructs, including those not in the intersection closure of context-free languages, and that they can provide very succinct descriptions o...

متن کامل

Conjunctive Grammars and Alternating Pushdown Automata Draft Paper

In this paper we introduce a variant of alternating pushdown automata, Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by conjunctive grammars.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007