Compiler Design(CD) Full Course
4.0
(1)
15 learners
What you'll learn
This course includes
- 15.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 58 lessons • 15.5 hours of video
Compiler Design(CD) Full Course
58 lessons
• 15.5 hours
Compiler Design(CD) Full Course
58 lessons
• 15.5 hours
- L1: Compiler Design Introduction | Types of Compiler | Compiler Design(CD) Lectures in Hindi 11:01
- L2: Cousins of Compiler | Preprocessor, Assembler, Linker/Loader | Compiler Design Lectures Hindi 13:47
- L3: Phases of Compiler | 6 Phases of Compilation Process | Compiler Design(CD) Lectures in Hindi 17:16
- L4: Lexical Analysis Phase of Compiler | Functions of Lexical Analyzer | Compiler Design Lectures 13:47
- L5: Tokens, Patterns , Lexemes and Lexical Errors | Compiler Design(CD) Lectures in Hindi 16:23
- L6: Token Attribute, Symbol Table | Look Ahead | Compiler Design(CD) Lectures in Hindi 15:46
- L7: Syntax analysis, Parsing | Tasks performed by Parser | Compiler Design(CD) Lectures in Hindi 13:58
- L8: Grammar, Four Components, How to Derive Strings from Grammar | Compiler Design Lectures in Hindi 17:29
- L9: Parse Tree, Properties, Yield of Tree, Types of Parsers | Compiler Design Lectures in Hindi 15:22
- L10: Error Handling during Syntax Analysis | Parser Error Recovery Mechanisms | Compiler Design 14:53
- L11: Grammar for arithmetic expressions, Generation, Deriving Strings | Compiler Design Lectures 15:31
- L12: Sentential form of a grammar, Context Free Grammar, Language | Compiler Design Lectures Hindi 13:52
- L13: Leftmost/Rightmost/Canonical Derivation, Ambiguous Grammar | Compiler Design Lectures in Hindi 16:00
- L14: Associativity, Precedence of Operators | Solved Examples | Compiler Design Lectures in Hindi 16:29
- L15: Convert ambiguous grammar into unambiguous | Example | Compiler Design(CD) Lectures in Hindi 19:12
- L16: Left Recursion, How to Remove Left Recursion | Advantages, Disadvantages | Compiler Design 18:54
- L17: Examples of Left Recursion | How to remove left recursion | Compiler Design Lectures in Hindi 13:55
- L18: Syntax Directed Definition | Annotated Parse Tree | Compiler Design(CD) Lectures in Hindi 15:32
- L19: Parse Tree Construction | Solved Example | Compiler Design(CD) Lectures in Hindi 17:38
- L20: Abstract, Concrete Syntax Tree | Depth First Traversal | Compiler Design Lectures in Hindi 15:28
- L21: Translation, Difference b/w Syntax Directed Def, Translation Scheme | Compiler Design Lectures 14:12
- L22: Semantic Actions and Translation Scheme Solved Examples | Compiler Design(CD) Lectures in Hindi 10:10
- L23: What is FIRST() | How to find FIRST() of a non terminal | Compiler Design(CD) Lectures in Hindi 19:59
- L24: Solved Examples of Finding FIRST() | Compiler Design(CD) Lectures in Hindi 17:09
- L25: What is Follow() | How to find Follow() of a non terminal | Compiler Design(CD) Lectures 17:00
- L26: Solved Examples on finding Follow() | Compiler Design(CD) Lectures in Hindi 15:32
- L27: Left Factoring, How and Why to Remove Left Factoring | Compiler Design(CD) Lectures in Hindi 14:05
- L28: Solved Examples of how to remove left factoring | Compiler Design(CD) Lectures in Hindi 11:42
- L29: Bottom Up Parsing | Shift Reduce Parsing | Compiler Design(CD) Lectures in Hindi 13:58
- L30: How are handles used in bottom up parsing | Compiler Design(CD) Lectures in Hindi 11:40
- L31: Handle Pruning with Solved Example | Compiler Design(CD) Lectures in Hindi 08:50
- L32: Stack Implementation of Shift Reduce Parsing | Compiler Design(CD) Lectures in Hindi 13:12
- L33: Solved Example of performing shift reduce parsing using a stack | Compiler Design(CD) Lectures 15:28
- L34: Stack for SR Parsing, Types of Conflicts | Compiler Design(CD) Lectures in Hindi 16:00
- L35: Solved Example of SR (shift reduce), RR (reduce reduce) conflict | Compiler Design(CD) Lectures 15:10
- L36: Operator Precedence Grammar | Properties | Compiler Design(CD) Lectures in Hindi 11:54
- L37: Operator Precedence Table | Operator Precedence Parsing | Compiler Design(CD) Lectures in Hindi 19:31
- L38: Operator precedence parsing using Stack | Compiler Design(CD) Lectures in Hindi 17:15
- L39: Advantage/Disadvantage of Operator Precedence Parsing | Compiler Design(CD) Lectures in Hindi 19:25
- L40: Operator Precedence Functions | Construct Graph | Compiler Design(CD) Lectures in Hindi 19:35
- L41: Introduction to LR(k) Parsers | Benefits, Types | Compiler Design(CD) Lectures in Hindi 15:22
- L42: Components and Working of LR-Parsers | Behavior of LR Parser | Compiler Design Lectures Hindi 13:21
- L43: Parsing Actions Performed by LR Parser | LR Parser Configuration | Compiler Design Lectures 25:18
- L44: LR(0) Items | Augmented Grammars | Kernel Items | Compiler Design(CD) Lectures in Hindi 18:00
- L45: Closure Function, How to perform closure of set of LR(0) items | Compiler Design Lectures Hindi 15:55
- L46: GOTO Function, How to perform goto operation on a grammar | Compiler Design Lectures in Hindi 17:36
- L47: How to Find Canonical Collection of LR(0) Items | Compiler Design(CD) Lectures in Hindi 18:01
- L48: Construction of LR(0) Parsing Table | Final Items | Compiler Design(CD) Lectures in Hindi 20:54
- L49: Parsing a String using a LR(0) Parser | Stack, Input Buffer | Compiler Design Lectures Hindi 20:32
- L50: Canonical collection of LR(0) items for SLR(1) parser | Compiler Design(CD) Lectures in Hindi 16:16
- L51: LR(0) Parsing Table | SLR(1) Parsing Table | Examples | Compiler Design(CD) Lectures in Hindi 20:58
- L52: SR-Conflict & RR-Conflict in Parsing Table | Compiler Design(CD) Lectures in Hindi 20:13
- L53: Canonical Collection of LR(1) Items | Construction | Compiler Design(CD) Lectures in Hindi 20:02
- L54: Solved Examples of LR(1) Items Part 2 | Compiler Design(CD) Lectures in Hindi 11:06
- L55: Construction of CLR Parsing Table | Compiler Design(CD) Lectures in Hindi 19:40
- Compiler Design Solved Questions Part 1 - Syntax Directed Translation Scheme, Grammar Questions 15:01
- Compiler Design Solved Questions Part 2 - Control Flow Graph and other important Numericals 18:33
- Compiler Design Solved Questions Part 3 | Abstract Syntax Tree and Control Graph Important Numerical 19:40
Take this course with you
Download the app to continue lessons from your phone anytime.
