What you will 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.
Description
_______________________________________________________________
|**** Visit my website for better offers in instructor profile. ****|
————————————————————————–
Welcome to the course “The Ultimate : Compiler Design for 2021 – 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 decision
So,
Come and join me, I assure you that you will have the best learning experience of compiler Design.
English
language
Content
Phase I : Lexical Analysis
Lexical Analysis – Introduction
Identification of Tokens with example
Why ID for identifiers and Secondary functionalities of Lexical Analyzer
Counting tokens from Source Code.
Phase II : Syntax Analysis
Syntax Analysis and Parse Tree Introduction
Syntax Analysis
Context Free Grammar Definition and Examples
Derivation Definition and Examples
CFG Classification
CFG Classification : Based on Derivation Trees – Ambiguous & Unambiguous Grammar
CFG Classification : Based on Strings – Recursive and NonRecursive Grammars.
Types of Recursion : Left, Right and General Recursion.
Left Recursive to Right Recursive Grammar Conversion.
Verifying Grammar is Ambiguous or not with Examples.
Common Prefixes Problem and Left Factoring.
First Definition
First Examples
Follow Definition and Examples
Phase II : Top Down Parser – LL(1)
LL(1) Parsing Algorithm
Procedure to consturct LL(1) Parse Table.
LL(1) or not – Example – 2
LL(1) or not – Example – 3
Shortcut to decide LL(1) or not
Phase II : Bottom Up Parsers (BUP)
Bottom Up Parser Introduction (Handle and Handle Pruning).
Block Diagram of Bottom Up Parser
Understanding Working of Block Diagram with Example.
Classification of BUP
LR Parsers and Classification.
Procedure to Construct LR Parse Table.
Augmented Grammar with Example
Phase II : Bottom Up Parsers – LR(0) Grammar
LR(0) Item Introduction
LR(0) Items Canonical Collection – Closure()
LR(0) Items Canonical Collection – Goto()
LR(0) Conficts – SR Conflict and RR Conflict
Example – 1 ( Part 1 )
Example – 1 ( Part 2 )
Example – 2
Example – 3
Example – 4
Example – 5
Example – 6 , 7 and 8
Example – 9, 10, 11 and 12
Example – 13 and 14
Relation Between LL(1) and LR(0)
Phase II : Bottom Up Parsers – SLR(1) Grammar
SLR(1) Introduction and Example – 1
Example – 2
Example – 3
Example – 4
SLR(1) Conflicts – SR and RR
Example 5 and 6