Playlist Duration

Playlist · Gate Smashers

Compiler Design (Complete Playlist)

by Gate Smashers · 39 videos

Listed in Best free GATE CSE courses on YouTube, ranked by total hours

Total watch time

5h 58m

at 1× speed · exactly 5 hours, 58 minutes, 3 seconds at 1×

At an hour a day you'd finish in 6 days

The shape of the course

Each column is one video, to scale

17:13

WatchedTo watch

Compare Open on YouTube JSON

Next time, skip the copying: change youtube.com to playlistduration.com in any playlist, video or channel address and it opens here. Or see the total on YouTube itself, with our extension for Chrome, Firefox or Edge.

Your plan

Plan to finish

About 6 days at an hour a day

Pick a daily pace and the days you'll watch. Ticked videos are skipped.

Days

At one hour a day, every day, this playlist takes about 6 days. Turn on JavaScript to plan around your week.

Videos (39)

5h 58m in total · tick what you've watched

Tick videos you've watched — progress is saved in this browser. Titles open on YouTube in a new tab.

Videos to
Watched
1 Lec-1: Compiler Design Syllabus Discussion for Competitive & College/University Exams 6:24 2020-09-17
2 Lec-2: Phases of Compiler with examples | Compiler Design 14:33 2020-09-18
3 Lec-3: Lexical Analysis in Compiler Design with Examples 9:10 2020-09-19
4 Lec-4: Token Count using Lexical Analysis | Questions on Lexical Analysis | Imp Questions 8:47 2020-09-21
5 Lec-5: Find First() in Compiler Design | First() & Follow() | Compiler Design 10:37 2020-09-22
6 Lec-6: Find FOLLOW() in Compiler Design | Learn First() & Follow() in Easiest way 9:27 2020-09-24
7 Lec-7: What is Parsing & Types of Parsers | Syntax Analysis 9:38 2020-09-25
8 Lec-8: LL(1) Parsing Table | Check Whether a Grammar is LL(1) or Not 10:57 2020-09-27
9 Lec-9: How to Check a Grammar is LL(1) or Not | Short Trick 9:12 2020-09-26
10 Lec-10: What is LL(1) Parser | How it Works | Full Concept 9:27 2020-09-29
11 Lec-11: LR(0) Parsing Table | Check Whether a Grammar is LR(0) or not | Bottom-Up Parser 16:46 2020-09-30
12 Lec-12: SLR(1) Parsing Table | Check Whether a Grammar is SLR(1) or Not | Bottom-Up Parser 7:46 2020-10-04
13 Lec-13: CLR Parsing Table | LR(1) Canonical Items 11:50 2020-10-24
14 Lec-14: LALR Parsing Table | LALR vs CLR | Compiler Design 13:06 2020-10-25
15 Lec-15: Difference between LALR & CLR parsing table | Imp. Example | Compiler Design 17:13 2020-10-27
16 Lec-16: Difference between LR(0), SLR(1), LALR(1) & CLR(1) using Same example 8:34 2020-10-28
17 Lec-17: What is SDT(Syntax Directed Translation) & its Applications | Semantic Analysis 6:31 2020-10-29
18 Lec-18: How to Parse SDT (Top Down vs Bottom Up Parsing) | Syntax Directed Translation 9:06 2020-10-30
19 Lec-19: How to Evaluate Arithmetic Expression using SDT | Syntax Directed Translation Example 9:34 2020-10-31
20 Lec-20: S-Attributed vs L-Attributed SDT | Types of SDT 10:11 2020-11-01
21 Lec-21: Gate Question on S-Attributed and L-Attributed SDT | Compiler Design 4:48 2020-11-05
22 Lec-22: Intermediate Code Generation with example 8:12 2020-11-06
23 Lec-23: What is 3-Address Code in Compiler 5:17 2020-11-15
24 Lec-24: Peephole Optimization in Compiler | Dead code elimination | Strength reduction 10:19 2020-11-17
25 Lec-25: What is Code Optimization | Machine Dependent vs Machine Independent Techniques 7:25 2020-11-17
26 Lec-26: Loop Optimization in Compiler 6:56 2020-11-21
27 Lec-27: Question on Code Optimization in Compiler 7:09 2020-11-22
28 Lec-28: What is Control Flow Graph | Basic Blocks 10:09 2020-11-24
29 Lec-29: What is Basic Block & Flow Graph in Compiler | Partition Algorithm in Basic Block 8:31 2020-11-25
30 Lec-30: Local vs Global Optimization | Scope of Optimization 8:56 2020-11-26
31 Lec-31: Liveness Analysis in Code optimization | Dataflow analysis 15:08 2020-11-28
32 Lec-32: Comparison of all Parsers in Compiler Design 5:27 2021-01-18
33 Lec-33: Symbol Table in Compiler Design | Attributes of Symbol Table in Hindi 8:10 2021-07-31
34 Lec-34: Error Detection And Recovery | Lexical Phase Error | Compiler Design 6:38 2021-08-03
35 Lec-35: Symbol Table Data Structure Implementation in Hindi 8:28 2021-08-05
36 Lec-36: Lexeme vs Tokens in Compiler Design 5:54 2021-09-17
37 Lec-37: Ambiguous vs Unambiguous Grammar with examples | Conversion Ambiguous ➡️ Unambiguous 9:30 2022-12-06
38 Lec-48: Derivation Tree 🌲Parse Tree 🌲 with example in TOC & Compiler design 6:33 2022-11-22
39 Lec-50: Recursive vs Non-Recursive CFG with examples | Classification of CFG 5:44 2022-11-23
For your README

Embed a badge

Show the watch time in a README or course description — it links back here and updates itself

Watch time: 5h 58m · 39 videos

Markdown
[![Watch time: 5h 58m · 39 videos](https://playlistduration.com/badge/playlist/PLxCzCOWd7aiEKtKSIHYusizkESC42diyc.svg)](https://playlistduration.com/playlist/PLxCzCOWd7aiEKtKSIHYusizkESC42diyc)
HTML
<a href="https://playlistduration.com/playlist/PLxCzCOWd7aiEKtKSIHYusizkESC42diyc"><img src="https://playlistduration.com/badge/playlist/PLxCzCOWd7aiEKtKSIHYusizkESC42diyc.svg" alt="Watch time: 5h 58m · 39 videos" width="203" height="20"></a>

Add ?speed=1.5 to the image URL for the time at that speed, ?label=Course to change the left text, or ?style=flat-square for square corners.

Want the numbers themselves? GET https://playlistduration.com/api/v1/playlist/PLxCzCOWd7aiEKtKSIHYusizkESC42diyc returns them as JSON — free, no key. API docs →

Data from the YouTube Data API as of 2026-10-23 (cached). Private or deleted videos are excluded from totals.