YoVDO

Elimination of Left Recursion in Compiler Design - Examples and Explanation

Offered By: Sundeep Saradhi Kanthety via YouTube

Tags

Compiler Design Courses Automata Theory Courses Parsing Courses Context-Free Grammars Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Compilers
Stanford University via edX
Build a Modern Computer from First Principles: Nand to Tetris Part II (project-centered course)
Hebrew University of Jerusalem via Coursera
Compiler Design
Indian Institute of Technology, Kharagpur via Swayam
Foundations to Computer Systems Design
Indian Institute of Technology Madras via Swayam
Compiler Design
YouTube