Skip to content

Grammar and Automata

Below is the Compiler Design (CD) Course table, aligned with GATE + PSU prep, same structure as your other courses, theory-focused and exam-oriented.


TopicSubtopics / What to Cover
Introduction to CompilerCompiler vs Interpreter ⭐⭐Phases of compiler ⭐⭐
Structure of CompilerFront end ⭐⭐Back end ⭐⭐
Lexical AnalysisTokens ⭐⭐Lexemes ⭐⭐Patterns ⭐⭐
Lexical AnalyzerInput buffering ⭐⭐Symbol table ⭐⭐
Regular ExpressionsRE basics ⭐⭐RE to DFA/NFA ⭐⭐
Finite AutomataDFA ⭐⭐NFA ⭐⭐DFA vs NFA ⭐⭐
Syntax AnalysisRole of parser ⭐⭐Types of parsing ⭐⭐
Context-Free GrammarGrammar rules ⭐⭐Derivations ⭐⭐
Parse TreesParse tree ⭐⭐Ambiguity ⭐⭐
Top-Down ParsingRecursive descent ⭐⭐LL(1) parsing ⭐⭐
Bottom-Up ParsingShift-reduce ⭐⭐LR parsing ⭐⭐
Operator PrecedenceOperator grammar ⭐
Syntax-Directed TranslationSDT ⭐⭐SDD ⭐⭐
Intermediate Code GenerationThree-address code ⭐⭐Quadruples ⭐⭐
Type CheckingStatic vs Dynamic ⭐⭐
Run-Time EnvironmentActivation record ⭐⭐Storage allocation ⭐⭐
Code OptimizationLocal optimization ⭐⭐Loop optimization ⭐⭐
Code GenerationTarget code ⭐⭐Register allocation ⭐⭐
Error HandlingLexical errors ⭐⭐Syntax errors ⭐⭐
Compiler ToolsLex ⭐Yacc ⭐
BootstrappingCompiler bootstrapping ⭐
Cross CompilerCross compilation ⭐

This table is:
Highly scoring for GATE
PSU-relevant
Numerical + theory balanced
Consistent with your GitBook format

If you want next:
Digital Electronics (DE) Course
Compiler Design last-day revision
PYQ mapping for CD