Context-sensitive grammar

A formal language that can be described by a context-sensitive grammar, or, equivalently, by a noncontracting grammar or a linear bounded automaton, is called a context-sensitive language. Some textbooks actually define CSGs as non-contracting, although this is not how Noam Chomsky defined them in 1959. This choice of definition makes no difference in terms of the languages generated (i.e. the two definitions are weakly equivalent), but it does make a difference in terms of what grammars are structurally considered context-sensitive; the latter issue was analyzed by Chomsky in 1963.

Chomsky introduced context-sensitive grammars as a way to describe the syntax of natural language where it is often the case that a word may or may not be appropriate in a certain place depending on the context. Walter Savitch has criticized the terminology "context-sensitive" as misleading and proposed "non-erasing" as better explaining the distinction between a CSG and an unrestricted grammar.

Although it is well known that certain features of languages (e.g. cross-serial dependency) are not context-free, it is an open question how much of CSGs' expressive power is needed to capture the context sensitivity found in natural languages. Subsequent research in this area has focused on the more computationally tractable mildly context-sensitive languages. The syntaxes of some visual programming languages can be described by context-sensitive graph grammars.

Formal definition

Formal grammar

Let us notate a formal grammar as $G = (N, Σ, P, S)$ , with $N$ a set of nonterminal symbols, $Σ$ a set of terminal symbols, $P$ a set of production rules, and $S \in N$ the start symbol.

A string $u \in (N \cup Σ)^{*}$ directly yields, or directly derives to, a string $v \in (N \cup Σ)^{*}$ , denoted as $u \Rightarrow v$ , if v can be obtained from u by an application of some production rule in P, that is, if $u = γ L δ$ and $v = γ R δ$ , where $(L \to R) \in P$ is a production rule, and $γ, δ \in (N \cup Σ)^{*}$ is the unaffected left and right part of the string, respectively. More generally, u is said to yield, or derive to, v, denoted as $u \Rightarrow^{*} v$ , if v can be obtained from u by repeated application of production rules, that is, if $u = u_{0} \Rightarrow . . . \Rightarrow u_{n} = v$ for some n ≥ 0 and some strings $u_{1}, . . ., u_{n - 1} \in (N \cup Σ)^{*}$ . In other words, the relation $\Rightarrow^{*}$ is the reflexive transitive closure of the relation $\Rightarrow$ .

The language of the grammar G is the set of all terminal-symbol strings derivable from its start symbol, formally: $L (G) = {w \in Σ^{*} ∣ S \Rightarrow^{*} w}$ . Derivations that do not end in a string composed of terminal symbols only are possible, but do not contribute to L(G).

Context-sensitive grammar

A formal grammar is context-sensitive if each rule in P is of either of the forms

αAβ → αγβ

A → ε

with $ε$ being the empty string, $A \in N$ , $α, β, γ \in (N \cup Σ)^{*}, γ \neq ε$ , i.e., α, β and γ are strings of nonterminals and terminals, but γ is not allowed to be empty. Without this restriction, the resulting grammars become equal in power to unrestricted grammars.

The name context-sensitive is explained by the α and β that form the context of A and determine whether A can be replaced with γ or not. By contrast, in a context-free grammar, no context is present: the left hand side of every production rule is just a nonterminal.

(Weakly) equivalent definitions

A noncontracting grammar is a grammar in which for any production rule, of the form u → v, the length of u is less than or equal to the length of v.

Every context-sensitive grammar is noncontracting, while every noncontracting grammar can be converted into an equivalent context-sensitive grammar; the two classes are weakly equivalent.

Some authors use the term context-sensitive grammar to refer to noncontracting grammars in general.

The left-context- and right-context-sensitive grammars are defined by restricting the rules to just the form αA → αγ and to just Aβ → γβ, respectively. The languages generated by these grammars are also the full class of context-sensitive languages. The equivalence was established by Penttonen normal form.

3 more chapters are free with a Lably account.

Examples

anbncn

The following context-sensitive grammar, with start symbol S, generates the canonical non-context-free language { aⁿbⁿcⁿ | n ≥ 1 } :

Rules 1 and 2 allow for blowing-up S to aⁿBC(BC)ⁿ⁻¹; rules 3 to 6 allow for successively exchanging each CB to BC (four rules are needed for that since a rule CB → BC wouldn't fit into the scheme αAβ → αγβ); rules 7–10 allow replacing a non-terminal B or C with its corresponding terminal b or c, respectively, provided it is in the right place. A generation chain for aaabbbccc is:

→₂ aSBC

→₂ aaSBCBC

→₁ aaaBCBCBC

→₃ aaaBCZCBC

→₄ aaaBWZCBC

→₅ aaaBWCCBC

→₆ aaaBBCCBC

→₃ aaaBBCCZC

→₄ aaaBBCWZC

→₅ aaaBBCWCC

→₆ aaaBBCBCC

→₃ aaaBBCZCC

→₄ aaaBBWZCC

→₅ aaaBBWCCC

→₆ aaaBBBCCC

→₇ aaabBBCCC

→₈ aaabbBCCC

→₈ aaabbbCCC

→₉ aaabbbcCC

→₁₀ aaabbbccC

→₁₀ aaabbbccc

anbncndn, etc.

More complicated grammars can be used to parse { aⁿbⁿcⁿdⁿ | n ≥ 1 }, and other languages with even more letters. Here we show a simpler approach using non-contracting grammars: Start with a kernel of regular productions generating the sentential forms $(A B C D)^{n} a b c d$ and then include the non contracting productions $p_{D a} : D a \to a D$ , $p_{D b} : D b \to b D$ , $p_{D c} : D c \to c D$ , $p_{D d} : D d \to d d$ , $p_{C a} : C a \to a C$ , $p_{C b} : C b \to b C$ , $p_{C c} : C c \to c c$ , $p_{B a} : B a \to a B$ , $p_{B b} : B b \to b b$ , $p_{A a} : A a \to a a$ .

ambncmdn

A non contracting grammar (for which there is an equivalent CSG) for the language $L_{C r o s s} = {a^{m} b^{n} c^{m} d^{n} ∣ m \geq 1, n \geq 1}$ is defined by

p_{0} : S \to R T

p_{1} : R \to a R C | a C

p_{3} : T \to B T d | B d

p_{5} : C B \to B C

p_{6} : a B \to a b

p_{7} : b B \to b b

p_{8} : C d \to c d

, and

p_{9} : C c \to c c

With these definitions, a derivation for $a^{3} b^{2} c^{3} d^{2}$ is: $S \Rightarrow_{p_{0}} R T \Rightarrow_{p_{1}^{2} p_{2}} a^{3} C^{3} T \Rightarrow_{p_{3} p_{4}} a^{3} C^{3} B^{2} d^{2} \Rightarrow_{p_{5}^{6}} a^{3} B^{2} C^{3} d^{2} \Rightarrow_{p_{6} p_{7}} a^{3} b^{2} C^{3} d^{2} \Rightarrow_{p_{8} p_{9}^{2}} a^{3} b^{2} c^{3} d^{2}$ .

a2i

A noncontracting grammar for the language { a^2ⁱ | i ≥ 1 } is constructed in Example 9.5 (p. 224) of (Hopcroft, Ullman, 1979):

$S \to [A C a B]$
${\begin{cases} [C a] a \to a a [C a] \\ [C a] [a B] \to a a [C a B] \\ [A C a] a \to [A a] a [C a] \\ [A C a] [a B] \to [A a] a [C a B] \\ [A C a B] \to [A a] [a C B] \\ [C a B] \to a [a C B] \end{cases}$
$[a C B] \to [a D B]$
$[a C B] \to [a E]$
${\begin{cases} a [D a] \to [D a] a \\ [a D B] \to [D a B] \\ [A a] [D a] \to [A D a] a \\ a [D a B] \to [D a] [a B] \\ [A a] [D a B] \to [A D a] [a B] \end{cases}$
$[A D a] \to [A C a]$
${\begin{cases} a [E a] \to [E a] a \\ [a E] \to [E a] \\ [A a] [E a] \to [A E a] a \end{cases}$
$[A E a] \to a$

Kuroda normal form

Every context-sensitive grammar which does not generate the empty string can be transformed into a weakly equivalent one in Kuroda normal form. "Weakly equivalent" here means that the two grammars generate the same language. The normal form will not in general be context-sensitive, but will be a noncontracting grammar.

The Kuroda normal form is an actual normal form for non-contracting grammars.

Properties and uses

Equivalence to linear bounded automaton

A formal language can be described by a context-sensitive grammar if and only if it is accepted by some linear bounded automaton (LBA). In some textbooks this result is attributed solely to Landweber and Kuroda. Others call it the Myhill–Landweber–Kuroda theorem. (Myhill introduced the concept of deterministic LBA in 1960. Peter S. Landweber published in 1963 that the language accepted by a deterministic LBA is context sensitive. Kuroda introduced the notion of non-deterministic LBA and the equivalence between LBA and CSGs in 1964.)

As of 2010 it is still an open question whether every context-sensitive language can be accepted by a deterministic LBA.

Closure properties

Context-sensitive languages are closed under complement. This 1988 result is known as the Immerman–Szelepcsényi theorem. Moreover, they are closed under union, intersection, concatenation, substitution, inverse homomorphism, and Kleene plus.

Every recursively enumerable language L can be written as h(L) for some context-sensitive language L and some string homomorphism h.

Computational problems

The decision problem that asks whether a certain string s belongs to the language of a given context-sensitive grammar G, is PSPACE-complete. Moreover, there are context-sensitive grammars whose languages are PSPACE-complete. In other words, there is a context-sensitive grammar G such that deciding whether a certain string s belongs to the language of G is PSPACE-complete (so G is fixed and only s is part of the input of the problem).

The emptiness problem for context-sensitive grammars (given a context-sensitive grammar G, is L(G)=∅ ?) is undecidable.

As model of natural languages

Savitch has proven the following theoretical result, on which he bases his criticism of CSGs as basis for natural language: for any recursively enumerable set R, there exists a context-sensitive language/grammar G which can be used as a sort of proxy to test membership in R in the following way: given a string s, s is in R if and only if there exists a positive integer n for which scⁿ is in G, where c is an arbitrary symbol not part of R.

It has been shown that nearly all natural languages may in general be characterized by context-sensitive grammars, but the whole class of CSGs seems to be much bigger than natural languages. Worse yet, since the aforementioned decision problem for CSGs is PSPACE-complete, that makes them totally unworkable for practical use, as a polynomial-time algorithm for a PSPACE-complete problem would imply P=NP.

It was proven that some natural languages are not context-free, based on identifying so-called cross-serial dependencies and unbounded scrambling phenomena. However this does not necessarily imply that the class of CSGs is necessary to capture "context sensitivity" in the colloquial sense of these terms in natural languages. For example, linear context-free rewriting systems (LCFRSs) are strictly weaker than CSGs but can account for the phenomenon of cross-serial dependencies; one can write a LCFRS grammar for {aⁿbⁿcⁿdⁿ | n ≥ 1} for example.

Ongoing research on computational linguistics has focused on formulating other classes of languages that are "mildly context-sensitive" whose decision problems are feasible, such as tree-adjoining grammars, combinatory categorial grammars, coupled context-free languages, and linear context-free rewriting systems. The languages generated by these formalisms properly lie between the context-free and context-sensitive languages.

More recently, the class PTIME has been identified with range concatenation grammars, which are now considered to be the most expressive of the mild-context sensitive language classes.

Formal definition

Formal grammar

Context-sensitive grammar

(Weakly) equivalent definitions

Examples

anbncn

anbncndn, etc.

ambncmdn

a2i

Kuroda normal form

Properties and uses

Equivalence to linear bounded automaton

Closure properties

Computational problems

As model of natural languages

More in Language and linguistics