Chomsky Normal Form

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/compiler-design/grammar-cfg/normal-forms-bnf/asset-chomsky-normal-form after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Theory of Computation: 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
  10. Compiler Design: 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
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…