Understand transfermation of source code to parse tree.
Understand parser in exclusive manner.
NO prerequisite required.
The Objectives of this course is to explore the principles, algorithms, and data structures involved in the design and construction of compilers. Topics include context-free grammars, lexical analysis, parsing techniques, symbol tables, error recovery, code generation, and code optimization.
After completion of this course each student will implement a compiler for a small programming language.
Who this course is for:
willing to learn compiler clearly.
6 sections • 50 lectures • 7h 49m total length
Why ID for identifiers and Secondary functionalities of Lexical Analyzer
Counting tokens from Source Code.
Syntax Analysis and Parse Tree Introduction
Context Free Grammar Definition and Examples
Derivation Definition and Examples
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.
Follow Definition and Examples
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
Bottom Up Parser Introduction (Handle and Handle Pruning).
Block Diagram of Bottom Up Parser
Understanding Working of Block Diagram with Example.
Hi, I am Atchyut Kumar Reddy. I have eight years experience in GATE CS/IT coaching in India which is one of prestigious exam. I did my Masters from National Institute of Technology-Calicut, India. I am GATE CS/IT top ranker. I have four years of experience in database development. Under my guidance, many students got GATE ranks and jobs.