Converting a Grammar Into Deterministic Grammar
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a detailed lecture on converting non-deterministic grammars into deterministic grammars using the process of left factoring, a fundamental concept in compiler design. The instructor begins by presenting a specific problem on the screen: "Consider the following non-deterministic grammar and convert them into deterministic grammar by the process of left factoring." The initial grammar given is $S
ightarrow aSb / abS / ab$. He demonstrates the left factoring technique by first factoring out the common 'a', rewriting the production as $S
ightarrow aS'$. He then defines the new non-terminal $S'$ with the remaining suffixes: $S'
ightarrow Sb / bS / b$. He points out that $S'$ still has a common prefix 'b' in the second and third alternatives. He proceeds to factor out 'b' again, rewriting $S'$ as $S'
ightarrow Sb / bS''$ and defining $S''
ightarrow S / \epsilon$.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a clear problem statement displayed on the screen: "Consider the following non-deterministic grammar and convert them into deterministic grammar by the process of left factoring." The specific grammar provided is $S ightarrow aSb / abS / ab$. The instructor explains that this grammar is non-deterministic because the first two productions share a common prefix 'a'. He proceeds to apply the left factoring technique. First, he identifies the common prefix 'a' and rewrites the production rule as $S ightarrow aS'$. He then defines the new non-terminal $S'$ with the remaining parts of the original productions: $S' ightarrow Sb / bS / b$. However, he observes that the productions for $S'$ still contain a common prefix 'b' in the second and third alternatives ($bS$ and $b$). To resolve this, he factors out 'b' again, rewriting $S'$ as $S' ightarrow Sb / bS''$. Finally, he defines the new non-terminal $S''$ with the remaining parts: $S'' ightarrow S / \epsilon$.
2:00 – 4:23 02:00-04:23
The lecture transitions to a second example to reinforce the concept. The new grammar is $S ightarrow ab / abc / abcd / b$. The instructor starts by identifying the common prefix 'a' in the first three productions. He factors this out, rewriting the rule as $S ightarrow aS' / b$, and defines $S' ightarrow b / bc / bcd$. He then notices that $S'$ has a common prefix 'b' in all its alternatives. He factors out 'b' to get $S' ightarrow bS''$ and defines $S'' ightarrow \epsilon / c / cd$. The process continues as he identifies a common prefix 'c' in the last two alternatives of $S''$. He rewrites $S''$ as $S'' ightarrow cS''' / \epsilon$ and defines $S''' ightarrow d$. The video concludes with a slide titled "Simplification or Minimization of CFG," introducing the next topic of eliminating useless symbols, unit productions, and null productions.
The video effectively demonstrates the algorithmic approach to left factoring through two distinct examples, moving from a grammar with recursive structures to one with string literals. The instructor emphasizes the iterative nature of the process, showing that multiple levels of common prefixes may need to be factored out sequentially.

