Chomsky hierarchy

The Chomsky hierarchy in the fields of formal language theory, computer science, and linguistics, is a containment hierarchy of classes of formal grammars.

Uses your system voice; voice and rate in settings.

≈ 5 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The Chomsky hierarchy in the fields of formal language theory, computer science, and linguistics, is a containment hierarchy of classes of formal grammars. A formal grammar describes how to form strings from a formal language's alphabet that are valid according to the language's syntax.

The linguist Noam Chomsky theorized that four different classes of formal grammars existed that could generate increasingly complex languages. Each class can also completely generate the language of all inferior classes (set inclusive).

Regular (Type-3) grammars

Type-3 grammars generate the regular languages. Such a grammar restricts its rules to a single nonterminal on the left-hand side and a right-hand side consisting of a single terminal, possibly followed by a single nonterminal, in which case the grammar is right regular.

Alternatively, all the rules can have their right-hand sides consist of a single terminal, possibly preceded by a single nonterminal (left regular). These generate the same languages. However, if left-regular rules and right-regular rules are combined, the language need no longer be regular.

The rule S \rightarrow \varepsilon is also allowed here if S does not appear on the right side of any rule. These languages are exactly all languages that can be decided by a finite-state automaton. Additionally, this family of formal languages can be obtained by regular expressions.

Regular languages are commonly used to define search patterns and the lexical structure of programming languages. For example, the regular language L = \{a^n \mid n > 0\} is generated by the Type-3 grammar G = (\{S\}, \{a\}, P, S) with the productions P being the following. In linguistics, a language that is not regular is called supra-regular.

Context-free (Type-2) grammars

Type-2 grammars generate the context-free languages. These are defined by rules of the form A \rightarrow \alpha with A being a nonterminal and \alpha being a string of terminals and/or nonterminals. These languages are exactly all languages that can be recognized by a non-deterministic pushdown automaton.

Context-free languages—or rather its subset of deterministic context-free languages—are the theoretical basis for the phrase structure of most programming languages, though their semantic analysis includes context-sensitive name resolution due to declarations and scope. Often a subset of grammars is used to make parsing easier, such as by an LL parser.

For example, the context-free language L = \{a^nb^n \mid n > 0\} is generated by the Type-2 grammar G = (\{S\}, \{a, b\}, P, S) with the productions P being the following. The language is context-free but not regular (by the pumping lemma for regular languages). Every context-free language can be generated by a grammar in Chomsky normal form.

Context-sensitive (Type-1) grammars

Type-1 grammars generate context-sensitive languages. These grammars have rules of the form \alpha A\beta \rightarrow \alpha\gamma\beta with A a nonterminal and \alpha , \beta and \gamma strings of terminals and/or nonterminals. The strings \alpha and \beta may be empty, but \gamma must be nonempty.

The rule S \rightarrow \epsilon is allowed if S does not appear on the right side of any rule. The languages described by these grammars are exactly all languages that can be recognized by a linear bounded automaton (a nondeterministic Turing machine whose tape is bounded by a constant times the length of the input.)

For example, the context-sensitive language L = \{a^nb^nc^n \mid n > 0\} is generated by the Type-1 grammar G = (\{S,A,B,C,W,Z\}, \{a, b, c\}, P, S) with the productions P being the following. The language is context-sensitive but not context-free (by the pumping lemma for context-free languages).

A proof that this grammar generates L = \{a^nb^nc^n \mid n > 0\} is sketched in the article on Context-sensitive grammars.

Recursively enumerable (Type-0) grammars

Type-0 grammars include all formal grammars. There are no constraints on the productions rules. They generate exactly all languages that can be recognized by a Turing machine, thus any language that is possible to be generated can be generated by a Type-0 grammar.

These languages are also known as the recursively enumerable or Turing-recognizable languages. Note that this is different from the recursive languages, which can be decided by an always-halting Turing machine. L = \{a^nb^mc^md^n \mid n,m > 0\} is not regular, which can be shown using the pumping lemma for context-free languages.

In subsequent decades, it was shown that natural language is also not context-free, using the example of cross-serial dependencies in Swiss German. In this case, the argument is that the language L = \{a^nb^mc^nd^m \mid n,m > 0\} is not context-free.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378275678 under CC BY-SA 4.0; modifications have been made.

Words in each sectionRegular (Type-3) gramma…Regular (Type-3) grammarsRegular (Type-3) grammars: 190 words190Context-sensitive (Type…Context-sensitive (Type-1) grammarsContext-sensitive (Type-1) grammars: 178 words178Recursively enumerable …Recursively enumerable (Type-0) grammarsRecursively enumerable (Type-0) grammars: 164 words164Context-free (Type-2) g…Context-free (Type-2) grammarsContext-free (Type-2) grammars: 158 words158
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001378275678 · captured 2026-10-03 · ledger · version history

Cite this page as: encyclopegia.org, “Chomsky hierarchy”, snapshot enwiki-001378275678. https://encyclopegia.org/a/chomsky-hierarchy

Sources cited in this revision

7 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.