Scribd
Upload
4 views

TOC_pdf

The document outlines Chomsky's classification of grammars, which categorizes languages based on their generative power into four types: Type 0 (Recursively Enumerable), Type 1 (Context-Sensitive), Type 2 (Context-Free), and Type 3 (Regular). Each type corresponds to a specific computational model and has distinct characteristics and applications in fields like programming languages and natural language processing. The document serves as an introduction to formal language theory and its significance in computational linguistics.

Uploaded by

rishudos6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

TOC_pdf

The document outlines Chomsky's classification of grammars, which categorizes languages based on their generative power into four types: Type 0 (Recursively Enumerable), Type 1 (Context-Sensitive), Type 2 (Context-Free), and Type 3 (Regular). Each type corresponds to a specific computational model and has distinct characteristics and applications in fields like programming languages and natural language processing. The document serves as an introduction to formal language theory and its significance in computational linguistics.

Uploaded by

rishudos6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

CHOMSKY CLASSIFICATION

OF GRAMMAR

Student Name : RISHU RAJ


Univ. Roll No : 13000223099
Univ. Reg. No : 2313000110907
Department : IT ‘B’
Subject Name :Formal Language & Automata Theory
Subject Code : PCC-CS401
Introduction to Chomsky Hierarchy

Content:
In 1956, Noam Chomsky introduced a hierarchy of grammars that classifies languages
based on their generative power.
This hierarchy is crucial for understanding formal language theory, automata, and
computational linguistics.
Each grammar type corresponds to a computational model, ranging from simple finite
automata to powerful Turing machines.
Overview of the Four Types of Grammars
Type 0 – Recursively Enumerable Grammars
Definition:
Type 0 grammars are also known as phrase structure
grammars or semi-Thue grammars.
They can generate any language that can be recognized
by a Turing machine.

Characteristics:
No restrictions on production rules.
Requires a Turing Machine to recognize languages.
Some languages generated by this grammar are not
decidable (e.g., Halting Problem).
Type 1 – Context-Sensitive Grammars (CSG)
Definition:
Every production rule follows the form:
α → β, where |α| ≤ |β|
Recognized by Linear Bounded Automaton (LBA).
More restrictive than Type 0, but still powerful enough for
natural language processing.
Example:

Applications:
Used in compilers, programming languages, and NLP.
Type 2 – Context-Free Grammars (CFG)
Definition:
A grammar where the left-hand side of every
production contains a single non-terminal.
Recognized by a Pushdown Automaton (PDA).
Used extensively in compilers and programming
languages.
|α| =1 There is no restriction on β.The production rules
are in the form of −
A->α, Where, A is any single non-
terminal and is any combination of terminals
and nonterminals.
Example: S --> AB
A --> a
B --> b
Applications: Syntax analysis in programming languages
HTML/XML parsing, Arithmetic expressions, AI grammar .
Type 3 – Regular Grammars (RG)
Definition:
Most restricted grammar, where rules follow:
A → aB (Right Linear) or A → a (Left Linear).
Recognized by a Finite Automaton (DFA/NFA).
Used in lexical analysis, regex, and pattern matching.

Example:
L = { a⁺ }
A language containing one or more occurrences of ‘a’.

Applications:
Text searching, lexical analysis
in compilers, and pattern
matching algorithms.
References

References
GeeksForGeeks.com
Theory of Computation-KLP Mishra
ChatGPT

THANK YOU!!!

You might also like