Converting a Grammar Into Deterministic Grammar

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/toc-compiler/grammar-cfg/left-factoring-prefixes/asset-converting-a-grammar-into-deterministic-grammar 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.

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

  1. 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. 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.

Loading lesson…