Removing Left Recursion

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-theory-of-computation/grammar-cfg/derivation-recursion/asset-removing-left-recursion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…