Compiler Design (CD)

Learn Compiler Design (CD) the exam way—clear concepts, worked examples, and 58 focused lessons in computer science core.

Instructor: DAKALA SREENIVASULU

Last updated Aug 2026 en

14 learners enrolled

all-levels

This course includes

— on-demand video
Access on mobile & desktop
Full lifetime access
Certificate of completion

Course content

9 sections · 58 lectures

Lec-01 : Introduction Preview
Lec-02 : Lexical Analysis : Phases of compiler
Lec-03 : Syntax & Semantic : Phases of compiler
Lec-04 : Code Generation : Phase of compiler
Lec-05 : Lexical analyzer : Phases
Lec-06 : Cross compiler
Lec-07 : Bootstrapping

Lec-08 : Shift reduce parsing Preview
Lec-09 : Operator precedence parser
Lec-10 : Top down parser introduction
Lec-11 : Backtracking parser | Top-Down
Lec-12 : Predective parser | Top-Down

Lec-13 : LL Parser | Predictive Parser | Top-Down Preview
Lec-14 : LL(1) Parser | First & Follow Function
Lec-15 : LL(1) Parser | Example-1
Lec-16 : LL(1) Parser | Example-2
Lec-17 : LR Parsing | Introduction
Lec-18 : LR(0) Parsing | Items
Lec-19 : LR(0) Parsing | Table
Lec-20 : LR(0) Parsing| Input string

Lec-21 : SLR(1) parsing example | LR(0) items Preview
Lec-22 : CLR(1) parsing | LR(1) items
Lec-23 : CLR(1) parsing Example | LR(1) items
Lec-24 : CLR(1) parsing | Table | LR(1) items
Lec-25 : LALR (1) parsing | LR(1) items

Lec-26 : Lexical analyzer | Implementation Preview
Lec-27 : Lexical analyzer using LEX tool - 1 | Implementation
Lec-28 : Lexical analyzer using LEX tool - 2 | implementation
Lec-29 : Parser using YACC tool - 1 | Implementation
Lec-30 : Parser using YACC tool - 2 | Implementation
Lec-31 : LA & Parser using PLY tool | Implementation

Lec-32 : SDT: Syntax Directed translation Preview
Lec-33 : SDT: Syntax Directed Translation | Scheme
Lec-34 : Translation of Assignment statements
Lec-35 : Boolean Expression

Lec-36 : Intermediate code Generation Preview
Lec-37 : AST & Polish | Intermediate code Generation
Lec-38 : Three address code | Intermediate code Generation
Lec-39 : Type checking
Lec-40 : Type Expressions & System
Lec-41 : Type conversion | Implicit & Explicit

Lec-42 : Symbol table | Implementation Preview
Lec-43 : Representing scope information
Lec-44 : Symbol table structure
Lec-45 : Symbol table
Lec-46 : Errors | Lexical, Syntax & Semantic
Lec-47 : Storage Organisation | Runtime memory
Lec-48 : Activation record
Lec-49 : Storage allocation | Static, Stack & Heap

Lec-50 : Source of optimization | Principle Preview
Lec-51 : Code optimization technique
Lec-52 : Loop Optimisation | Code motion & Strength reduction
Lec-53 : Code generator | Issues in Design -1
Lec-54 : Code generator | Issues in Design - 2
Lec-55 : Global dataflow Analysis
Lec-56 : DAG : Directed Acyclic Graph | Algorithm
Lec-57 : DAG : Directed Acyclic Graph Examples
Lec-58 : Peephole optimization

Explore related topics

Computer Science all-levels

Description

Compiler Design (CD) is an exam-focused computer science core programme designed for B.Tech / MCA learners and anyone revising CS subjects for semester exams (all levels). Lessons are paced for semester revision and competitive practice, with clear explanations you can replay anytime.

You will connect definitions to exam-style problems in Compiler Design (CD), so you can write clearer answers, dry-run code mentally, and revise units in order. Syllabus highlights include Compiler Phases, Parsing & Types, Parser : LL, LR, Parser :SLR, CLR & LALR, Tools : LEX, YACC & PLY, and SDT : Syntax Directed translation. Across 58 lessons, you will move from foundations to problem-solving patterns that show up in university papers and placement tests.

Taught by DAKALA SREENIVASULU, this course keeps theory short and practice heavy—so you can revise faster, spot examiner cues, and build confidence before mocks and finals.