CFG to CNF Conversion with ε (Epsilon) | Chomsky Normal Form Solved Example | TOC
👉 Theory Of Computation Playlist : • ⭐ Theory of Computation Made Easy
CFG to CNF conversion step by step with solved example in Theory of Computation.
In this video, we convert the following Context Free Grammar (CFG) into Chomsky Normal Form (CNF):
S → aAB | ε
A → bBB | aS | a
B → bA | a
This example includes epsilon (ε) production, making it an important exam-level problem.
What You Will Learn:
How to handle S → ε during CNF conversion
How to remove null productions correctly
How to check whether ε should be kept or removed
How to replace terminals in mixed productions
How to break long productions into binary form
Final verification of CNF rules
CNF Rules Reminder:
A CFG is in Chomsky Normal Form if every production is of the form:
A → BC
A → a
S → ε (only if ε belongs to the language)
Language must remain the same after conversion.
This video is helpful for:
B.Tech CSE students
Semester exam preparation
GATE CSE Theory of Computation
UGC NET Computer Science
Compiler Design
Subscribe for the complete TOC series.
Like if this video helped you understand CNF clearly.
Comment your doubts — I reply to every comment.
Share with your classmates preparing for exams.
Thank you for watching.
Keep Learning. Keep Growing.
#cnf #cfg #theoryofcomputation #automatatheory #compilerdesign #contextfreegrammar #gatecse #ugcnetcs #btech #computerscience #engineering #toc