Converting a Grammar Into Deterministic Grammar

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/compiler-design/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…