Chomsky hierarchy

Grammar complexity ranking

The Chomsky hierarchy is a classification of formal grammars into four nested types, each generating increasingly complex languages.

Type 3 (regular) grammars are the most restricted; type 2 (context-free) describe most programming languages; type 1 (context-sensitive) and type 0 (unrestricted) allow progressively more computational power.

The hierarchy maps directly onto classes of abstract machines—finite automata, pushdown automata, linear-bounded automata, and Turing machines.

Named for linguist Noam Chomsky, who proposed it in 1956.

grammar

context-free grammar

Production system, single left nonterminals

computation

automata

Self-moving mechanical devices

context-sensitive · deterministic · non-deterministic · Church-Turing thesis · acceptance · rejection · tape · alphabet

classification

levels

Heights or ranked stages

restriction · power · inclusion · language classes · nesting · subset · superset · computational power

linguistics

universal grammar

Innate linguistic faculty hypothesis

innateness · minimalist program

Categories
Opposites
formal vs. natural language frameworks

Chomsky hierarchynatural language

Human communication, not programming

sociolinguistics · phonology · morphology · phonetics · dialectology

theoretical abstraction vs. practical implementation

Chomsky hierarchyproduction code

Software serving real users

Family

hierarchy, hierarchical, hierarchies, hierarchically, nonhierarchical, Chomsky

Familiarity
Top 1,000,000
Profile
Used worldwide · Timeless · Abstract · Rated G