Removing Left Recursion

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-PRELIMS/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. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  4. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  5. Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends
  18. Artificial Intelligence: Artificial Intelligence
  19. Unit Test - Professional Knowledge:
  20. Full Length 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…