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