Removing Left Recursion

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/compiler-design/grammar-cfg/derivation-recursion/asset-removing-left-recursion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture is an educational session on removing left recursion from Context-Free Grammars (CFG), presented by Sanchit Jain Sir from Knowledge Gate. The primary objective is to transform left-recursive productions into right-recursive ones, which is a necessary step for top-down parsing algorithms like LL(1). The instructor begins by defining the general form of left recursion where a non-terminal A produces itself followed by some string alpha, or other strings beta. He visually demonstrates the problem of infinite recursion using parse trees. He then introduces the standard algorithmic solution involving the creation of a new non-terminal symbol, typically denoted as A prime, to handle the recursive part. The lecture systematically covers various forms, starting with a single recursive alternative and multiple non-recursive alternatives, then moving to multiple recursive alternatives with a single non-recursive alternative, and finally combining both into a comprehensive general form.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the fundamental form of left recursion: A -> A alpha / beta_1 / beta_2. He explains that the production A -> A alpha causes left recursion. To visualize the issue, he draws a parse tree showing how A expands into A alpha, which expands into A alpha alpha, leading to an infinite loop. He then presents the solution by rewriting the grammar. The new productions are A -> beta_1 A' / beta_2 A' and A' -> alpha A' / epsilon. He also writes the equivalent regular expression (beta_1 + beta_2) alpha star to show the language generated. He generalizes this to n alternatives: A -> A alpha / beta_1 / beta_2 ... / beta_n.

  2. 2:00 – 5:00 02:00-05:00

    The lecture shifts to a case with multiple left-recursive alternatives: A -> A alpha_1 / A alpha_2 / beta. The instructor draws a parse tree for this structure, showing multiple branches leading back to A. He derives the regular expression beta (alpha_1 + alpha_2) star. The transformation involves creating a new non-terminal A'. The resulting productions are A -> beta A' and A' -> alpha_1 A' / alpha_2 A' / epsilon. He generalizes this to n recursive alternatives: A -> A alpha_1 / A alpha_2 ... / A alpha_n / beta. The solution becomes A -> beta A' and A' -> alpha_1 A' / alpha_2 A' ... / alpha_n A' / epsilon.

  3. 5:00 – 5:31 05:00-05:31

    The final segment combines both previous cases into the most general form: A -> A alpha_1 / A alpha_2 ... / A alpha_n / beta_1 / beta_2 ... / beta_m. Here, there are n left-recursive alternatives and m non-left-recursive alternatives. The instructor writes the final set of productions to remove left recursion. The new A productions are A -> beta_1 A' / beta_2 A' ... / beta_m A'. The new A' productions are A' -> alpha_1 A' / alpha_2 A' ... / alpha_n A' / epsilon. This covers all scenarios of direct left recursion.

The video provides a structured approach to eliminating direct left recursion, a critical preprocessing step for constructing predictive parsers. By breaking down the problem into specific cases and then generalizing, the instructor helps students recognize patterns in grammar rules. The key takeaway is the separation of the grammar into two parts: one that initiates the derivation with non-recursive symbols (beta) and another that handles the repetition of the recursive suffix (alpha) using a new non-terminal (A prime). This transformation preserves the language generated by the grammar while making it suitable for top-down parsing strategies. The progression from simple examples to the most complex general form ensures a deep understanding of the underlying logic required for compiler design.

Loading lesson…