Chomsky Normal Form

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/toc-compiler/grammar-cfg/normal-forms-bnf/asset-chomsky-normal-form after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces the concept of Normalization for Context-Free Grammars (CFG), specifically focusing on Chomsky Normal Form (CNF). The instructor defines CNF as a state where every production rule follows the format A → BC or A → a, where B and C are non-terminals and a is a terminal. The session transitions into a practical demonstration using the grammar S → aSb / ab. The instructor systematically converts this grammar into CNF by introducing auxiliary non-terminals to replace terminals and breaking down right-hand sides that exceed length two. Finally, the lecture concludes by deriving a mathematical property: for any string of length n derived from a CNF grammar, the number of production steps required is exactly 2n - 1.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins with a slide titled 'Normalization of CFG'. The text defines Chomsky Normal Form, stating that a grammar G is in CNF if every production is in the form A → BC / a. Below this, the constraints are listed: B, C ∈ Vn (non-terminals) and a ∈ Σ (terminals). The instructor underlines the phrase 'Chomsky Normal Form' and uses red arrows to point to the components A, B, C, and a on the slide, emphasizing the structural requirements of the rule. He specifically highlights that B and C must be non-terminals from the set Vn, while a must be a terminal from the set Σ.

  2. 2:00 – 5:00 02:00-05:00

    The instructor moves to a whiteboard example with the production S → aSb / ab. He explains that this is not in CNF because the right-hand side contains terminals mixed with non-terminals and has a length of three. He introduces new non-terminals A and B with productions A → a and B → b. He rewrites the main rule as S → ASB / AB. Since ASB has length three, he introduces a new variable S1 (written as SA or similar) to split it, creating S1 → AS. The final normalized grammar is listed as S → S1 B / AB, S1 → AS, A → a, and B → b. He emphasizes that every rule must now strictly follow the A → BC or A → a format.

  3. 5:00 – 6:29 05:00-06:29

    The instructor discusses the relationship between string length and derivation steps. He writes |w| = n and states that for a CNF grammar, the number of productions needed is 2n - 1. He demonstrates this with a calculation: 2(4) - 1 = 7. He lists the sequence of sentential forms for a derivation of length 4: S, S1 B, ASB, aSB, aAB, aBb, ab. This confirms that there are exactly 7 steps, matching the formula. He circles the final string ab to show the result. The slide text reiterates that if a CFG is in CNF, the number of sentential forms for a string of length n is 2n - 1.

The lesson effectively bridges theory and practice. It begins by defining the rigid structural constraints of Chomsky Normal Form, ensuring productions are binary or unary. It then applies these constraints to normalize a specific grammar, demonstrating the necessary introduction of new variables to handle mixed terminals and long sequences. The session concludes by establishing a critical algorithmic property: the linear relationship between string length and derivation steps (2n - 1), which is fundamental for parsing algorithms like CYK.

Loading lesson…