YoVDO

Context-Free Grammars - LR(k) Grammars

Offered By: Write your own Operating System via YouTube

Tags

Context-Free Grammars Courses

Course Description

Overview

Explore the LR-Technique for constructing a parser from a Context-Free Grammar in this comprehensive 49-minute video. Delve into the intricacies of LR(k) Grammars, starting with an introduction to the concept and progressing through its working principles. Learn about state transitions, nonterminals, and the reduce operation. Understand the challenges of reduce-reduce conflicts and discover how follow sets can help resolve them. Gain insights into LR1 Grammar and its applications. Conclude with a summary of key takeaways and practical implications for parser construction in operating system development.

Syllabus

Intro
How it works
State Transitions
Nonterminals
Reduce
Reduce Reduce Conflict
Follow Sets
LR1 Grammar
Conclusion


Taught by

Write your own Operating System

Related Courses

Automata Theory
Stanford University via edX
Theory of Computation
Massachusetts Institute of Technology via MIT OpenCourseWare
Formal Language and Automata Theory- An Application in Compiler Design
Chhattisgarh Swami Vivekanand Technical University via Swayam
Formal Language and Automata Theory- An Application in Compiler Design (औपचारिक भाषा और स्वचालित सिद्धांत: कंपाइलर डिज़ाइन में एक अनुप्रयोग)
IGNOU via Swayam
Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam