Compiler Design
Offered By: YouTube
Course Description
Overview
Syllabus
Lec-1: Compiler Design Syllabus Discussion for Competitive & College/University Exams.
Lec-2: Phases of Compiler with examples | Compiler Design.
Lec-3: Lexical Analysis in Compiler Design with Examples.
Lec-4: Questions on Lexical Analysis | Imp Questions on Lexical Analysis.
Lec-5: Find First() in Compiler Design | First() & Follow().
Lec-6: Find FOLLOW() in Compiler Design | Learn First() & Follow() in Easiest way.
Lec-7: What is Parsing & Types of Parsers.
Lec-8: LL(1) Parsing Table | Check Whether a Grammar is LL(1) or Not.
Lec-9: How to Check a Grammar is LL(1) or Not | Short Trick.
Lec-10: What is LL(1) Parser | How it Works | Full Concept.
Lec-11: LR(0) Parsing Table | Check Whether a Grammar is LR(0) or not | Bottom-Up Parser.
Lec-12: SLR(1) Parsing Table | Check Whether a Grammar is SLR(1) or Not | Bottom-Up Parser.
Lec-13: CLR Parsing Table | LR(1) Canonical Items.
Lec-14: LALR Parsing Table | LALR vs CLR.
Lec15: Difference between LALR & CLR parsing table | Imp. Example.
Lec-16: Difference between LR(0), SLR(1), LALR(1) & CLR(1) using Same example.
Lec-17: What is SDT(Syntax Directed Translation) & its Applications | Semantic Analysis.
Lec-18: How to Parse SDT (Top Down vs Bottom Up Parsing) | Syntax Directed Translation.
Lec-19: How to Evaluate Arithmetic Expression using SDT | Syntax Directed Translation Example.
Lec-20: S-Attributed vs L-Attributed SDT | Types of SDT.
Lec-21: Gate Question on S-Attributed and L-Attributed SDT.
Lec-22: Intermediate Code Generation with example.
Lec-23: What is 3-Address Code in Compiler.
Lec-24: What is Peephole Optimization in Compiler.
Lec-25: What is Code Optimization | Machine Dependent vs Machine Independent Techniques.
Lec-26: Loop Optimization in Compiler.
Lec-27: Question on Code Optimization in Compiler.
Lec-28: What is Control Flow Graph | Basic Blocks.
Lec-29: What is Basic Block & Flow Graph in Compiler | Partition Algorithm in Basic Block.
Lec-30: Local vs Global Optimization | Scope of Optimization.
Lec-31: Liveness Analysis in Code optimization | Dataflow analysis.
Lec-32: Comparison of all Parsers in Compiler Design.
Taught by
Gate Smashers
Related Courses
CompilersStanford 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 What's New in F# 4.5 - Features, Fixes, and Performance Enhancements
Microsoft via YouTube