Compiler Design
29 articles in this topic
Semantic Analysis and SDT in Compiler Design: Attributes, Worked Examples, and How GATE Tests It
Learn how semantic analysis validates meaning, how SDDs and SDTs evaluate attributes, and how to trace two common exam-style problems to their final answers.
Code Optimization in Compiler Design: Basic Blocks, Data Flow and Worked Examples
Learn how compiler optimizers use basic blocks, control-flow graphs and data-flow facts. Two checked traces cover loop strength reduction, liveness and safe dead-code removal.
Bottom-Up Parsing in Compiler Design: Shift-Reduce, LR Parsers, and Worked Examples
Learn bottom-up parsing as a mechanical stack process, then work through an expression trace and a complete LR(0) automaton construction.
Run-Time Environment in Compiler Design: Activation Records, Access Links, and Worked Examples
Learn how code, static data, heap, and stack work together at run time. Follow worked examples for recursion depth, stack bytes, and nonlocal access.
Lexical Analysis in Compiler Design: Tokens, Patterns, and DFA-Based Scanning with Worked Examples
Learn how a scanner turns source characters into tokens, how token patterns become DFAs, and how longest match, lookahead, and token-counting questions work.
Intro to Compilers (Compiler Design): The Six Phases Traced with Worked Examples
Follow position = initial + rate * 60 through lexical, syntax and semantic analysis, intermediate code, optimisation, and target code. The worked trace turns six memorised phase names into one visible pipeline.
Intermediate Code Generation in Compiler Design: Three-Address Code, Quadruples, Triples and Worked Examples
Learn how a compiler produces intermediate code, represents it as quadruples or triples, removes repeated work with a DAG, and handles control flow.
Grammar and CFG in Compiler Design: Complete Guide with Worked Examples
Build grammar and CFG concepts from the formal definition to parse trees, parser-ready transformations and LL(1), using one expression grammar throughout.
Compiler Design for GATE: Syllabus Areas, Weightage Pattern and How to Prepare
See what GATE Compiler Design covers, where practice questions concentrate, how to solve a complete FIRST/FOLLOW example, and which topics to study first.
Closures in JavaScript Explained: Lexical Scope, the Loop Trap and Interview Questions
Go beyond the one-line closure definition. Predict a private counter, understand why var timers print 3 three times, and learn the two standard fixes.
Phases of a Compiler for GATE: One Statement Traced Through Every Phase
Follow position = initial + rate * 60 through all six compiler phases. Each step shows the exact artifact, error class and hand-off that GATE can test.
LL(1) Parsing Table Construction for GATE
Build an LL(1) table cell by cell, test it for conflicts, and see how left recursion and common prefixes break predictive parsing.