Converting a Grammar Into Deterministic Grammar

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/computer-architecture-it-specialist/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. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): 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
  17. Descriptive Test (Main Exam): English Writing Ability
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…