Compiler Design Gate Smashers Jun 2026

Recursive Descent, LL(1) (uses First and Follow sets). Bottom-Up Parsers: LR(0), SLR(1), LALR(1), CLR(1). Hierarchy: CLR(1) is the most powerful; LR(0) is the least. 📐 Syntax Directed Translation (SDT) S-Attributed: Uses only synthesized attributes (bottom-up).

A compiler translates high-level code (C/C++) into low-level code (Assembly/Machine Code). Gate Smashers Take: Think of a compiler as a factory assembly line. Raw source code goes in; machine code comes out. The line has 6 phases. compiler design gate smashers

If a grammar is unambiguous and LR(1), check FOLLOW sets – if no overlap, it's SLR(1). Recursive Descent, LL(1) (uses First and Follow sets)

Uses only synthesized attributes (evaluated bottom-up). Raw source code goes in; machine code comes out

A "Gate Smasher" compiler optimization transforms this into a single stream of instructions without jumps:

Instead of relying on the hardware to guess correctly, the compiler attempts to remove the gate entirely . The goal is to convert control dependencies (branching) into data dependencies (calculations).