Compiler Design || CD in Hindi || As per GTU 3170701
39 videos • 58,740 views • by Simplified By Sahitya
Compiler Design (3170701) subject in hindi as per Gujarat Technological University Syllabus.
1
Lec1 Introduction To Compiler Design
Simplified By Sahitya
Download
2
Lec2 Structure of a Compiler and its Phases with Example
Simplified By Sahitya
Download
3
Lec3 Compiler VS Interpreter and Types of Compiler
Simplified By Sahitya
Download
4
Lec4 Grouping of Phases in Compilers and 1 pass VS 2 pass Compiler
Simplified By Sahitya
Download
5
Lec5 Lexical Analyzer Introduction
Simplified By Sahitya
Download
6
Lec6 Tokens Patterns & Lexemes
Simplified By Sahitya
Download
7
Mini Lecture Lexeme Example
Simplified By Sahitya
Download
8
Lec7 Input Buffer in Lexical Analyzer
Simplified By Sahitya
Download
9
Mini Lecture: Lexical Errors
Simplified By Sahitya
Download
10
Lec 8 Strings & Languages for Lexical Analyzer
Simplified By Sahitya
Download
11
Lec9 Regular Expressions for Token Generation
Simplified By Sahitya
Download
12
Mini Lecture Transition Diagrams
Simplified By Sahitya
Download
13
Lec10 Lexical Analyzer Generator Lex OR Flex
Simplified By Sahitya
Download
14
Lec11 A | Introduction to Syntax Analysis | Role of Parser
Simplified By Sahitya
Download
15
Lec11 B | Common Programming Errors | Syntax Error Handling
Simplified By Sahitya
Download
16
Lec11 C | Error Recovery Strategies
Simplified By Sahitya
Download
17
Lec11 D | Why Separate Lexical and Syntax Analysis | Syntax VS Lexical Analysis
Simplified By Sahitya
Download
18
Lec11 E | Introduction to Context Free Grammars | CFG Theory
Simplified By Sahitya
Download
19
Lec11 F | Leftmost and Rightmost Derivations in Parse Tree
Simplified By Sahitya
Download
20
Lec11 G | Types of Parser | Top-down VS Bottom-up Parsers
Simplified By Sahitya
Download
21
Lec12 Removing Left Recursion in Top Down Parsing
Simplified By Sahitya
Download
22
Lec13 Left Factoring given Context Free Grammar | Top Down Parsing | Compiler Design |
Simplified By Sahitya
Download
23
Lec14 Removing Ambiguity | Dangling Else Problem | Top Down Parsing | Compiler Design
Simplified By Sahitya
Download
24
Lec15 Recursive Descent Parser | Top-down Parsing
Simplified By Sahitya
Download
25
Lec16 Finding First and Follow | LL1 Parsing | Compiler Design
Simplified By Sahitya
Download
26
Lec17 Creating LL(1) Parsing Table | Checking if Grammar is LL(1) | Top Down Parsing
Simplified By Sahitya
Download
27
Lec18 Generating Parse Tree using LL(1) Parsing Table | Top Down Parsing
Simplified By Sahitya
Download
28
Lec19 Bottom Up Parsers | Shift Reduce Parser | Compiler Design
Simplified By Sahitya
Download
29
Lec20 Operator Precedence Parser | Bottom Up Parsers | Compiler Design
Simplified By Sahitya
Download
30
Lec21 SLR Parsing | Finding Closure & Goto | Bottom Up Parsing
Simplified By Sahitya
Download
31
Lec22 SLR Parsing | Creating Parsing Table | Parsing Input String | Bottom Up Parsing
Simplified By Sahitya
Download
32
Lec23 CLR & LALR Parsers | Creating Parsing Table | SLR VS CLR VS LALR Parser
Simplified By Sahitya
Download
33
Lec24 Introduction to Syntax Directed Translation (SDT)| SDD | Types of SDT
Simplified By Sahitya
Download
34
Lec25 Synthesized Attribute | S Attributed Definition | Creating Decorated Parse Tree
Simplified By Sahitya
Download
35
Lec26 Inherited Attributes | L Attributed Definitions | Sytax Directed Translation
Simplified By Sahitya
Download
36
Lec27 Intermediate Code Generation and Its Types
Simplified By Sahitya
Download
37
Lec28 Three Address Code Implementation | Quadruple | Triples | Indirect Triples
Simplified By Sahitya
Download
38
Lec29 Differentiate Quadruple, Triples and Indirect Triples
Simplified By Sahitya
Download
39
Lec30 Introduction to Run Time Memory Management
Simplified By Sahitya
Download