The Ultimate Compiler Design for 2023 Module 1
What you’ll learn
Understand Lexical and Syntax phases of compiler.
Understand each phase functionalities clearly.
Understand transfermation of source code to parse tree.
Understand parser in exclusive manner.
NO prerequisite required.
_______________________________________________________________|**** Visit my website for better offers in instructor profile. ****|————————————————————————–Welcome to the course “The Ultimate : Compiler Design for 2023 – Module 1”.Objective:The Objectives of this course is to explore the principles, algorithms, and data structures involved in the design and construction of compilers. Outcome: After completion of this course each student will implement a compiler for a small programming language.What you will learn:Lexical Analysis.First and Follow.CFG Classification.Ambiguous and Unambiguous grammar and Recursive and non-recursive grammars.Top Down Parsers : LL(1)Bottom Up Parsers : LR(0), SLR(1) grammars.Who this course is for:Academic Students.Interview Preparation Persons.Competitive Exam Preparation Aspirants.Anyone interested in Compiler Design.Those who want to become a highly paid coding developer.Those who want to open up doors in your IT career by learning one of the world’s most popular and in-demand programming.Important information before you enroll!If you find the course is not useful for your career, don’t forget you are covered by a 30-day money back guarantee.Once enrolled, you have unlimited, 24/7, lifetime access to the course (unless you choose to drop the course during the first 30 days).You will have instant and free access to any updates I’ll add to the course – video lectures, additional resources, quizzes, exercises.You will benefit from my full support regarding any question you might have.Check out the promo video at the top of this page and some of the free preview lectures in the curriculum to get a taste of my teaching style and methods before making your decisionSo,Come and join me, I assure you that you will have the best learning experience of compiler Design.
Section 1: Getting Start
Lecture 1 Language Processing System.
Lecture 2 Analysis and Synthesis Phases.
Lecture 3 Six Phases of Compiler
Lecture 4 Six Phases of Compiler : Example
Section 2: Phase I : Lexical Analysis
Lecture 5 Lexical Analysis – Introduction
Lecture 6 Identification of Tokens with example
Lecture 7 Why ID for identifiers and Secondary functionalities of Lexical Analyzer
Lecture 8 Counting tokens from Source Code.
Section 3: Phase II : Syntax Analysis
Lecture 9 Syntax Analysis and Parse Tree Introduction
Lecture 10 Syntax Analysis
Lecture 11 Context Free Grammar Definition and Examples
Lecture 12 Derivation Definition and Examples
Lecture 13 CFG Classification
Lecture 14 CFG Classification : Based on Derivation Trees – Ambiguous & Unambiguous Grammar
Lecture 15 CFG Classification : Based on Strings – Recursive and NonRecursive Grammars.
Lecture 16 Types of Recursion : Left, Right and General Recursion.
Lecture 17 Left Recursive to Right Recursive Grammar Conversion.
Lecture 18 Verifying Grammar is Ambiguous or not with Examples.
Lecture 19 Common Prefixes Problem and Left Factoring.
Lecture 20 First Definition
Lecture 21 First Examples
Lecture 22 Follow Definition and Examples
Section 4: Phase II : Top Down Parser – LL(1)
Lecture 23 LL(1) Parsing Algorithm
Lecture 24 Procedure to consturct LL(1) Parse Table.
Lecture 25 LL(1) or not – Example – 2
Lecture 26 LL(1) or not – Example – 3
Lecture 27 Shortcut to decide LL(1) or not
Section 5: Phase II : Bottom Up Parsers (BUP)
Lecture 28 Bottom Up Parser Introduction (Handle and Handle Pruning).
Lecture 29 Block Diagram of Bottom Up Parser
Lecture 30 Understanding Working of Block Diagram with Example.
Lecture 31 Classification of BUP
Lecture 32 LR Parsers and Classification.
Lecture 33 Procedure to Construct LR Parse Table.
Lecture 34 Augmented Grammar with Example
Section 6: Phase II : Bottom Up Parsers – LR(0) Grammar
Lecture 35 LR(0) Item Introduction
Lecture 36 LR(0) Items Canonical Collection – Closure()
Lecture 37 LR(0) Items Canonical Collection – Goto()
Lecture 38 LR(0) Conficts – SR Conflict and RR Conflict
Lecture 39 Example – 1 ( Part 1 )
Lecture 40 Example – 1 ( Part 2 )
Lecture 41 Example – 2
Lecture 42 Example – 3
Lecture 43 Example – 4
Lecture 44 Example – 5
Lecture 45 Example – 6 , 7 and 8
Lecture 46 Example – 9, 10, 11 and 12
Lecture 47 Example – 13 and 14
Lecture 48 Relation Between LL(1) and LR(0)
Section 7: Phase II : Bottom Up Parsers – SLR(1) Grammar
Lecture 49 SLR(1) Introduction and Example – 1
Lecture 50 Example – 2
Lecture 51 Example – 3
Lecture 52 Example – 4
Lecture 53 SLR(1) Conflicts – SR and RR
Lecture 54 Example 5 and 6
Academic Students.,GATE aspirants.,Willing to learn compiler clearly.
Udemy | English | 8h 39m | 9.69 GB
Created by: Atchyut Kumar