Compiler Design (MCA333) crash course, Online MCA, Semester 3:
This subject covers how compilers translate programs, from grammars and finite automata through scanning, parsing, symbol tables, intermediate code, code…
- 15 video lessons
- 3h 48m
- Study notes
- 75 quiz questions
- Assignment
15 lessons in Compiler Design
Each lesson pairs one topic with a hand-picked video, trimmed to the part that teaches it.
About this subject
This subject covers how compilers translate programs, from grammars and finite automata through scanning, parsing, symbol tables, intermediate code, code generation and optimization. After it you will be able to design a lexical analyzer and parser for a small language, organize its symbol table, generate intermediate code and apply basic optimizations such as constant folding and loop optimization.
- 1
Introduction to Compilers
Module I, Introduction: Introduction to Compliers
Introduction to Compiler Design· Neso Academy· 14 min
Study notes 5 quiz questionsWatch lesson - 2
Chomsky Classification of Grammars
Module I, Introduction: Classification of grammars, Context free grammars, Regular grammars
Chomsky Classification of Grammar || GATECSE || TOC· THE GATEHUB· 26 min
Study notes 5 quiz questionsWatch lesson - 3
DFA and NFA
Module I, Introduction: Deterministic finite State Automata (DFA) & Non-DFA
Lec-19: DFA vs NFA in TOC in Hindi with examples | Must Watch· Gate Smashers· 8 min
Study notes 5 quiz questionsWatch lesson - 4
Lexical Analysis and Scanners
Module II, Syntax Analysis: Scanners
Introduction to Lexical Analyzer· Neso Academy· 15 min
Study notes 5 quiz questionsWatch lesson - 5
Top Down Parsing and LL(1) Grammars
Module II, Syntax Analysis: Top down parsing, LL grammars
Top Down Parsing | Requirement and Time Complexity of Top Down Parser | Parsers in Compiler Design· KnowledgeGATE by Sanchit Sir· 12 min
Study notes 5 quiz questionsWatch lesson - 6
Bottom Up Parsing and Operator Precedence
Module II, Syntax Analysis: Bottom up parsing, Polish expression Operator Precedence grammar
Operator Precedence Parser with Solved Examples | Operator Grammar | GATECS | Compiler Design· THE GATEHUB· 27 min
Study notes 5 quiz questionsWatch lesson - 7
LR Parsing and Comparison of Parsers
Module II, Syntax Analysis: IR grammars, Comparison of parsing methods
Lec-16: Difference between LR(0), SLR(1), LALR(1) & CLR(1) using Same example· Gate Smashers· 9 min
Study notes 5 quiz questionsWatch lesson - 8
Syntax Error Handling and Recovery
Module II, Syntax Analysis: Error handling
L10: Error Handling during Syntax Analysis | Parser Error Recovery Mechanisms | Compiler Design· Easy Engineering Classes· 15 min
Study notes 5 quiz questionsWatch lesson - 9
Symbol Table Handling Techniques
Module III, Symbol Table: Symbol table handling techniques
Lec-35: Symbol Table Data Structure Implementation in Hindi· Gate Smashers· 8 min
Study notes 5 quiz questionsWatch lesson - 10
Symbol Tables for Block Structured Languages
Module III, Symbol Table: Organization for non-block and block structured languages
compiler Design , Symbol Table,Block structured language &Non block structured language· DBS Talks· 13 min
Study notes 5 quiz questionsWatch lesson - 11
Run Time Storage: Static and Dynamic Allocation
Module IV, Code Generation/Intermediate Code Generation: Run time storage administration, Static and dynamic allocation
Storage allocation | Static, Stack and Heap | CD | Compiler Design | Lec- 49 | Bhanu Priya· Education 4u· 9 min
Study notes 5 quiz questionsWatch lesson - 12
Intermediate Code: Polish Notation, N-tuples, Syntax Trees
Module IV, Code Generation/Intermediate Code Generation: Intermediate forms of source program, Polish N-tuple and syntax trees
Quadruples,Triples,Indirect Triples | Representation of three address code | Compiler Design· THE GATEHUB· 13 min
Study notes 5 quiz questionsWatch lesson - 13
Semantic Analysis and Code Generation
Module IV, Code Generation/Intermediate Code Generation: Semantic analysis and code generation
Complete Compiler Design One Shot 4 Hours | Semester Exam Hindi· 5 Minutes Engineering· 28 min
Study notes 5 quiz questionsWatch lesson - 14
Constant Folding and Common Subexpression Elimination
Module V, Code Optimization: Code optimization, Folding, redundant sub-expression evaluation
Code Optimization Techniques in Compiler Design· LearnVidFun· 18 min
Study notes 5 quiz questionsWatch lesson - 15
Loop Optimization
Module V, Code Optimization: Optimization within iterative loops
Loop Optimization Techniques | Code Optimization | Compiler Design· THE GATEHUB· 13 min
Study notes 5 quiz questionsWatch lesson
Assignment
Tracing a Mini Expression Language Through Every Compiler Phase
Less scrolling. More passing.
- Free
Hand-picked video lessons
15 short lessons, each with the best YouTube explanation we could find, trimmed to the part that matters.
- Free login
Study notes
15 lessons come with a summary, key points, key terms and takeaways for quick revision.
- Free login
Quizzes
75 questions across the course, with the right answer and why, the moment you pick.
- Free login
Assignments
1 subject assignments with clear tasks, so you practise what each subject actually asks of you.
- Free login
Notebook
Write notes beside the video, stamped with the exact time, and jump back to that moment later.
- Free login
Progress that follows you
Completed lessons, quiz scores and where you stopped, saved to your account on every device.
- Live chat pass
Live chat
A members-only live chat beside every lesson: doubts, tips, stickers and GIFs with your batch. One ₹19 pass opens every live chat.
The Online MCA live chat. Study together, live.
A live chat right beside the video, shared by everyone studying Online MCA. Ask a Compiler Design doubt mid-lesson, share a shortcut, celebrate a finished semester.
- Live chat beside every lesson
- One live chat for all of Online MCA
- Members-only stickers & GIFs
- One ₹19 pass opens every live chat
Online MCA live chat
Anyone else finding Compiler Design tricky? 😅
Lesson 2 cleared it up for me. Watch it before the quiz
Doing it now, thanks!
Starting Android Programming tonight if anyone wants to go together
More from Online MCA Semester 3
All subjects- Sem 3
MCA339
Android Programming
This subject covers Android app development in Java, from the platform architecture and project setup through UI widgets, activities, intents, fragments,…
- 18 lessons
- 7h 9m
- Notes
- Quiz
- Sem 3
MCA301
Artificial Intelligence
This subject introduces the core ideas of Artificial Intelligence: how problems are represented, how search and heuristic algorithms like A* and AO* find…
- 18 lessons
- 4h 12m
- Notes
- Quiz
- Sem 3
MCA338
Big Data & Analytics using R
This subject introduces big data and the Hadoop ecosystem, covering HDFS, MapReduce, Pig, Hive, HBase and Big SQL, followed by data analysis and machine…
- 17 lessons
- 5h 58m
- Notes
- Quiz
- Sem 3
MCA334
Digital Image Processing
This subject covers how digital images are formed, enhanced in the spatial and frequency domains, restored, compressed, segmented, described and recognised.
- 17 lessons
- 4h 15m
- Notes
- Quiz
- Sem 3
MCA332
Digital Marketing Analytics
This subject covers digital marketing fundamentals using the DMI framework, search engine optimisation, mobile and email marketing, and web analytics.
- 16 lessons
- 2h 40m
- Notes
- Quiz
- Sem 3
MCA302
Information Storage Management
This subject covers storage networking technologies: DAS, NAS and SAN architectures, Fibre Channel components, cabling and topologies, SAN design, security,…
- 19 lessons
- 4h 35m
- Notes
- Quiz
Compiler Design: common questions
This subject covers how compilers translate programs, from grammars and finite automata through scanning, parsing, symbol tables, intermediate code, code generation and optimization. After it you will be able to design a lexical analyzer and parser for a small language, organize its symbol table, generate intermediate code and apply basic optimizations such as constant folding and loop optimization. It's the Compiler Design subject of Online MCA, Semester 3, in 15 lessons: Introduction to Compilers; Chomsky Classification of Grammars; DFA and NFA; Lexical Analysis and Scanners; Top Down Parsing and LL(1) Grammars; Bottom Up Parsing and Operator Precedence; LR Parsing and Comparison of Parsers; Syntax Error Handling and Recovery; Symbol Table Handling Techniques; Symbol Tables for Block Structured Languages; Run Time Storage: Static and Dynamic Allocation; Intermediate Code: Polish Notation, N-tuples, Syntax Trees; Semantic Analysis and Code Generation; Constant Folding and Common Subexpression Elimination; Loop Optimization.
Yes. Every video lesson is free to watch without an account. A free login unlocks study notes, quizzes, the assignment, a notebook and progress that syncs across devices.
About 3h 48m of video across 15 lessons, plus time for notes and quizzes. Go at your own pace; your place is saved.
Yes: “Tracing a Mini Expression Language Through Every Compiler Phase”. It comes after the last lesson, with a brief, clear tasks and how the work is judged.
A members-only live chat beside the video, shared by everyone studying Online MCA, where learners ask doubts, share tips and react with stickers and GIFs. One ₹19 pass, paid once from your InsideEdge wallet, opens the live chat for every degree.
No. It's a crash course to help you understand and revise the subject quickly. Use it alongside your official study material and assignments.