Gate Smashers Compiler Design: study plan and how long it takes
The Gate Smashers playlist is 39 videos and 6.0 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
39 videos · 6.0 hours · Gate Smashers
Gate Smashers' Compiler Design playlist covers lexical analysis and token counting, parsing with LL(1), LR(0), SLR, LALR and CLR parsers, syntax-directed translation, intermediate code generation, code optimization, control flow graphs, liveness analysis and error recovery.
It's six hours long, so it fits in a single week of revision.
Who it's for: GATE and university students revising compiler design.
How long does it take?
The full playlist is 6.0 hours across 39 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 12 days | 8 days | 6 days |
| 1 h a day | 6 days | 4 days | 3 days |
| 2 h a day | 3 days | 2 days | 2 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 30 minutes a day and normal speed, using whole videos so none is split across days. That's 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–16 · 2h 53m
Day 1 · 21m
- 1Lec-1: Compiler Design Syllabus Discussion for Competitive & College/University Exams6m
- 2Lec-2: Phases of Compiler with examples | Compiler Design15m
Day 2 · 29m
- 3Lec-3: Lexical Analysis in Compiler Design with Examples9m
- 4Lec-4: Token Count using Lexical Analysis | Questions on Lexical Analysis | Imp Questions9m
- 5Lec-5: Find First() in Compiler Design | First() & Follow() | Compiler Design11m
Day 3 · 19m
- 6Lec-6: Find FOLLOW() in Compiler Design | Learn First() & Follow() in Easiest way9m
- 7Lec-7: What is Parsing & Types of Parsers | Syntax Analysis10m
Day 4 · 30m
- 8Lec-8: LL(1) Parsing Table | Check Whether a Grammar is LL(1) or Not11m
- 9Lec-9: How to Check a Grammar is LL(1) or Not | Short Trick9m
- 10Lec-10: What is LL(1) Parser | How it Works | Full Concept9m
Day 5 · 25m
- 11Lec-11: LR(0) Parsing Table | Check Whether a Grammar is LR(0) or not | Bottom-Up Parser17m
- 12Lec-12: SLR(1) Parsing Table | Check Whether a Grammar is SLR(1) or Not | Bottom-Up Parser8m
Day 6 · 25m
- 13Lec-13: CLR Parsing Table | LR(1) Canonical Items12m
- 14Lec-14: LALR Parsing Table | LALR vs CLR | Compiler Design13m
Day 7 · 26m
- 15Lec-15: Difference between LALR & CLR parsing table | Imp. Example | Compiler Design17m
- 16Lec-16: Difference between LR(0), SLR(1), LALR(1) & CLR(1) using Same example9m
Week 2Videos 17–39 · 3h 5m
Day 8 · 25m
- 17Lec-17: What is SDT(Syntax Directed Translation) & its Applications | Semantic Analysis7m
- 18Lec-18: How to Parse SDT (Top Down vs Bottom Up Parsing) | Syntax Directed Translation9m
- 19Lec-19: How to Evaluate Arithmetic Expression using SDT | Syntax Directed Translation Example10m
Day 9 · 28m
- 20Lec-20: S-Attributed vs L-Attributed SDT | Types of SDT10m
- 21Lec-21: Gate Question on S-Attributed and L-Attributed SDT | Compiler Design5m
- 22Lec-22: Intermediate Code Generation with example8m
- 23Lec-23: What is 3-Address Code in Compiler5m
Day 10 · 25m
- 24Lec-24: Peephole Optimization in Compiler | Dead code elimination | Strength reduction10m
- 25Lec-25: What is Code Optimization | Machine Dependent vs Machine Independent Techniques7m
- 26Lec-26: Loop Optimization in Compiler7m
Day 11 · 26m
- 27Lec-27: Question on Code Optimization in Compiler7m
- 28Lec-28: What is Control Flow Graph | Basic Blocks10m
- 29Lec-29: What is Basic Block & Flow Graph in Compiler | Partition Algorithm in Basic Block9m
Day 12 · 30m
- 30Lec-30: Local vs Global Optimization | Scope of Optimization9m
- 31Lec-31: Liveness Analysis in Code optimization | Dataflow analysis15m
- 32Lec-32: Comparison of all Parsers in Compiler Design5m
Day 13 · 29m
- 33Lec-33: Symbol Table in Compiler Design | Attributes of Symbol Table in Hindi8m
- 34Lec-34: Error Detection And Recovery | Lexical Phase Error | Compiler Design7m
- 35Lec-35: Symbol Table Data Structure Implementation in Hindi8m
- 36Lec-36: Lexeme vs Tokens in Compiler Design6m
Day 14 · 22m
- 37Lec-37: Ambiguous vs Unambiguous Grammar with examples | Conversion Ambiguous ➡️ Unambiguous10m
- 38Lec-48: Derivation Tree 🌲Parse Tree 🌲 with example in TOC & Compiler design7m
- 39Lec-50: Recursive vs Non-Recursive CFG with examples | Classification of CFG6m
Tips for finishing
- Build the parsing tables by hand for at least one grammar of each type. That's the skill exams test.
- Watch it straight after Theory of Computation; the grammar topics overlap.