Elimination of Left Recursion in Compiler Design - Examples and Explanation
Offered By: Sundeep Saradhi Kanthety via YouTube
Course Description
Overview
Learn about left recursion in compiler design and how to eliminate it through this informative video tutorial. Explore the concept of left recursion, understand its impact on parsing, and master techniques for removing it from grammar rules. Gain practical knowledge through step-by-step examples that demonstrate the process of transforming left-recursive productions into non-left-recursive equivalents. Enhance your understanding of grammar manipulation and optimization techniques essential for efficient compiler construction.
Syllabus
Elimination of Left Recursion with Examples || What is Left Recursion? || Compiler Design
Taught by
Sundeep Saradhi Kanthety
Related Courses
Automata TheoryStanford University via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera System Validation: Automata and behavioural equivalences
EIT Digital via Coursera System Validation (3): Requirements by modal formulas
EIT Digital via Coursera