Context-free

From Wikipedia, the free encyclopedia.

The introduction to this article provides insufficient context for those unfamiliar with the subject.
Please help improve the article with a good introductory style.

In formal language theory, a context-free language is a language generated by some context-free grammar. The set of all context-free languages is identical to the set of languages accepted by pushdown automata.

1 Examples
2 Closure properties
- 2.1 Nonclosure under intersection
3 Decidability properties
4 Properties of context-free languages
5 References

[edit] Examples

An archetypical context-free language is $L = \{a^nb^n:n\geq1\}$ , the language of all non-empty even-length strings, the entire first halves of which are $a$ 's, and the entire second halves of which are $b$ 's. $L$ is generated by the grammar $S\to aSb ~|~ ab$ , and is accepted by the pushdown automaton $M = ({q 0, q 1, q f},{a, b},{a, z},δ, q 0,{q f})$ where $δ$ is defined as follows:

$δ(q 0, a, z) = (q 0, a)$
$δ(q 0, a, a) = (q 0, a)$
$δ(q 0, b, a) = (q 1, x)$
$δ(q 1, b, a) = (q 1, x)$
$δ(q 1, b, z) = (q f, z)$

$δ(s t a t e 1, r e a d, p o p) = (s t a t e 2, p u s h)$
where z is initial stack symbol and x means pop action.

Context-free languages have many applications in programming languages; for example, the language of all properly matched parentheses is generated by the grammar $S\to SS ~|~ (S) ~|~ \lambda$ . Also, most arithmetic expressions are generated by context-free grammars.

[edit] Closure properties

Context-free languages are closed under the following operations. That is, if L and P are context-free languages and D is a regular language, the following languages are context-free as well:

the Kleene star $L *$ of L
the image φ(L) of L under a homomorphism φ
the concatenation $L \circ P$ of L and P
the union $L \cup P$ of L and P
the intersection (with a regular language) $L \cap D$ of L and D

Context-free languages are not closed under complement, intersection, or difference.

[edit] Nonclosure under intersection

The context-free languages are not closed under intersection. This can be seen by taking the languages $A = \{a^m b^n c^n \mid m, n \geq 0 \}$ and $B = \{a^n b^n c^m \mid m,n \geq 0\}$ , which are both context-free. Their intersection is $A \cap B = \{ a^n b^n c^n \mid n \geq 0\}$ , which can be shown to be non-context-free by the pumping lemma for context-free languages.

[edit] Decidability properties

The following problems are undecidable for arbitrary context-free grammars A and B:

Equivalence: is $L (A) = L (B)$ ?
is $L(A) \cap L(B) = \emptyset$ ?
is $L (A) = Σ *$ ?
is $L(A) \subseteq L(B)$ ?

The following problems are decidable for arbitrary context-free languages:

is $L(A)=\emptyset$ ?
is $L (A)$ finite?
Membership: given any word w, does $w \in L(A)$ ? (membership problem is even polynomially decidable - see CYK algorithm)

[edit] Properties of context-free languages

The reverse of a context-free language is context-free, but the complement need not be.
Every regular language is context-free because it can be described by a regular grammar.
The intersection of a context-free language and a regular language is always context-free.
There exist context-sensitive languages which are not context-free.
To prove that a given language is not context-free, one may employ the pumping lemma for context-free languages.

[edit] References

Seymour Ginsburg (1966). The Mathematical Theory of Context-Free Languages. New York, NY, USA: McGraw-Hill, Inc..
Michael Sipser (1997). Introduction to the Theory of Computation. PWS Publishing. ISBN 0-534-94728-X. Chapter 2: Context-Free Languages, pp.91–122.

v • d • e

Automata theory: formal languages and formal grammars

Chomsky hierarchy	Grammars	Languages	Minimal automaton

Type-0 n/a Type-1 n/a n/a Type-2 n/a Type-3 n/a	Unrestricted (no common name) Context-sensitive Indexed Tree-adjoining etc. Context-free Deterministic context-free Regular n/a	Recursively enumerable Recursive Context-sensitive Indexed (Mildly context-sensitive) Context-free Deterministic context-free Regular Star-free	Turing machine Decider Linear-bounded Nested stack Embedded pushdown Nondeterministic pushdown Deterministic pushdown Finite Aperiodic finite

Each category of languages or grammars is a proper subset of the category directly above it;
and any automaton in each category has an equivalent automaton in the category directly above it.

This is an extract from Wikipedia, the Free Encyclopedia