NORMALIZATION OF CONTEXT FREE GRAMMAR | TAFL | LECTURE 03 BY MR. ANUPAM KUMAR SAINI | AKGEC
#AKGEC #AKGECGhaziabad #BestEngineeringCollege #BTech #MTech #MBA.
Dear All,
Please find the links to all five units for THEORY OF AUTOMATA & FORMAL LANGUAGES below:
THEORY OF AUTOMATA & FORMAL LANGUAGES Playlist
• THEORY OF AUTOMATA & FORMAL LANGUAGES BY M...
In this lecture, Mr. Anupam Kumar Saini from AKGEC explains the concept of Normalization of Context-Free Grammar (CFG) as part of the Theory of Automata and Formal Languages (TOC) course.
This lecture discusses different types of normal forms, their conversion techniques, and the importance of normalization in simplifying grammar for computational models.
👉 Topics Covered:
• Introduction to Context-Free Grammar (CFG)
• Need for Normalization in CFG
• Chomsky Normal Form (CNF)
• Greibach Normal Form (GNF)
• Step-by-step conversion of CFG to CNF and GNF
• Examples and solved problems
📚 Subject: Theory of Automata & Formal Languages (TOC)
🎓 Faculty: Mr. Anupam Kumar Saini | AKGEC
📺 Lecture 03
This lecture is highly useful for B.Tech Computer Science and IT students, and for GATE, NET, and university exam preparation in Automata Theory and Compiler Design.
Do subscribe to the AKGEC channel & get regular updates on videos: For more information: Please write to us at [email protected] or call us at +91-8744052891
🔵 Website: https://akgec.ac.in
🔵 Facebook: / official.akgec
🔵 Instagram: / official.akgec
🔵 LinkedIn: / officialakgec
🔵 Twitter: / official_akgec
--