Converting a Grammar Into Deterministic Grammar

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/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. 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.

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…