Context Sensitive Grammar

1 min read Updated Wed May 06 2026 17:34:33 GMT+0000 (Coordinated Universal Time)

Aka. CSG. An unrestricted grammar where every production αβ\alpha \to \beta satisfies βα|\beta| \geq |\alpha|.

Equivalent form: αAβαXβ\alpha A \beta \to \alpha X \beta where:

  • XΛX \neq \Lambda
  • AVA \in V
  • α,β,X(VΣ)\alpha, \beta, X \in (V \cup \Sigma)^*

Context-Sensitive Language

Aka. CSL. Languages generated by a CSG.

A language is context-sensitive iff it can be generated by a grammar in which every production has the form:

αAβαXβαAβ → αXβ

where α,βα, β and XX are strings of non-terminals and/or terminals, XΛX ≠Λ and AA is a non-terminal.