Introduction: The Ultimate Translation

Every time you write print("Hello, World!") and hit compile, a minor miracle occurs. Your human-readable code transforms through multiple layers of abstraction, eventually becoming a sequence of 1s and 0s that your CPU can execute directly. This transformation is the work of a compiler—one of the most sophisticated programs ever written.

Understanding compilers is essential for serious programmers because:

1. Performance: Knowing what the compiler does helps you write faster code
2. Debugging: Compiler errors make more sense when you understand compilation phases
3. Language design: Creating DSLs or new languages requires compiler knowledge
4. Career growth: Compiler engineering is a specialized, high-value skill

This article will demystify compilers by building a simple one from scratch, explaining each phase with working code.

The Compilation Pipeline

Modern compilers follow a multi-stage pipeline:

Copyinterface CompilerPipeline {
  // Frontend: Language-specific
  lexer: (source: string) => Token[];
  parser: (tokens: Token[]) => AST;
  semanticAnalyzer: (ast: AST) => TypedAST;
  
  // Middle-end: Language-agnostic optimization
  optimizer: (ir: IR) => IR;
  
  // Backend: Target-specific
  codeGenerator: (ir: IR) => MachineCode;
}

Let us build each component.

Phase 1: Lexical Analysis (Lexing)

The lexer breaks source code into tokens—the smallest meaningful units.

Copyenum TokenType {
  NUMBER,
  IDENTIFIER,
  KEYWORD,
  OPERATOR,
  LPAREN,
  RPAREN,
  LBRACE,
  RBRACE,
  SEMICOLON,
  EOF
}

interface Token {
  type: TokenType;
  value: string;
  line: number;
  column: number;
}

class Lexer {
  private pos = 0;
  private line = 1;
  private column = 1;
  private keywords = new Set(["let", "if", "else", "while", "return", "function"]);

  constructor(private source: string) {}

  private peek(): string {
    return this.source[this.pos] || "";
  }

  private advance(): string {
    const char = this.source[this.pos++];
    if (char === "\n") {
      this.line++;
      this.column = 1;
    } else {
      this.column++;
    }
    return char;
  }

  private skipWhitespace(): void {
    while (/\s/.test(this.peek())) {
      this.advance();
    }
  }

  private readNumber(): Token {
    const start = { line: this.line, column: this.column };
    let num = "";
    while (/[0-9.]/.test(this.peek())) {
      num += this.advance();
    }
    return { type: TokenType.NUMBER, value: num, ...start };
  }

  private readIdentifier(): Token {
    const start = { line: this.line, column: this.column };
    let id = "";
    while (/[a-zA-Z0-9_]/.test(this.peek())) {
      id += this.advance();
    }
    const type = this.keywords.has(id) ? TokenType.KEYWORD : TokenType.IDENTIFIER;
    return { type, value: id, ...start };
  }

  tokenize(): Token[] {
    const tokens: Token[] = [];

    while (this.pos < this.source.length) {
      this.skipWhitespace();
      if (this.pos >= this.source.length) break;

      const char = this.peek();
      const start = { line: this.line, column: this.column };

      if (/[0-9]/.test(char)) {
        tokens.push(this.readNumber());
      } else if (/[a-zA-Z_]/.test(char)) {
        tokens.push(this.readIdentifier());
      } else if ("+-*/=<>!".includes(char)) {
        let op = this.advance();
        // Check for two-character operators
        if ("=<>!".includes(char) && this.peek() === "=") {
          op += this.advance();
        }
        tokens.push({ type: TokenType.OPERATOR, value: op, ...start });
      } else if (char === "(") {
        this.advance();
        tokens.push({ type: TokenType.LPAREN, value: "(", ...start });
      } else if (char === ")") {
        this.advance();
        tokens.push({ type: TokenType.RPAREN, value: ")", ...start });
      } else if (char === "{") {
        this.advance();
        tokens.push({ type: TokenType.LBRACE, value: "{", ...start });
      } else if (char === "}") {
        this.advance();
        tokens.push({ type: TokenType.RBRACE, value: "}", ...start });
      } else if (char === ";") {
        this.advance();
        tokens.push({ type: TokenType.SEMICOLON, value: ";", ...start });
      } else {
        throw new Error("Unexpected character: " + char + " at " + start.line + ":" + start.column);
      }
    }

    tokens.push({ type: TokenType.EOF, value: "", line: this.line, column: this.column });
    return tokens;
  }
}

// Example usage
const code = "let x = 42 + 10;";
const lexer = new Lexer(code);
const tokens = lexer.tokenize();
console.log(tokens);
// Output: [{type: KEYWORD, value: "let"}, {type: IDENTIFIER, value: "x"}, ...]

Phase 2: Syntax Analysis (Parsing)

The parser builds an Abstract Syntax Tree (AST) from tokens, encoding the grammatical structure.

Copy// AST Node types
type ASTNode = 
  | NumberLiteral
  | Identifier
  | BinaryOp
  | Assignment
  | Block
  | IfStatement
  | WhileLoop
  | FunctionDecl;

interface NumberLiteral {
  type: "NumberLiteral";
  value: number;
}

interface Identifier {
  type: "Identifier";
  name: string;
}

interface BinaryOp {
  type: "BinaryOp";
  operator: string;
  left: ASTNode;
  right: ASTNode;
}

interface Assignment {
  type: "Assignment";
  name: string;
  value: ASTNode;
}

// Recursive descent parser
class Parser {
  private pos = 0;

  constructor(private tokens: Token[]) {}

  private peek(): Token {
    return this.tokens[this.pos];
  }

  private advance(): Token {
    return this.tokens[this.pos++];
  }

  private expect(type: TokenType): Token {
    const token = this.advance();
    if (token.type !== type) {
      throw new Error("Expected " + TokenType[type] + ", got " + TokenType[token.type]);
    }
    return token;
  }

  // Expression parsing with operator precedence
  private parseExpression(minPrecedence = 0): ASTNode {
    let left = this.parsePrimary();

    while (this.peek().type === TokenType.OPERATOR) {
      const op = this.peek().value;
      const precedence = this.getPrecedence(op);
      if (precedence < minPrecedence) break;

      this.advance();
      const right = this.parseExpression(precedence + 1);
      left = { type: "BinaryOp", operator: op, left, right };
    }

    return left;
  }

  private getPrecedence(op: string): number {
    const precedences: Record<string, number> = {
      "=": 1,
      "==": 2, "!=": 2,
      "<": 3, ">": 3, "<=": 3, ">=": 3,
      "+": 4, "-": 4,
      "*": 5, "/": 5
    };
    return precedences[op] || 0;
  }

  private parsePrimary(): ASTNode {
    const token = this.peek();

    if (token.type === TokenType.NUMBER) {
      this.advance();
      return { type: "NumberLiteral", value: parseFloat(token.value) };
    }

    if (token.type === TokenType.IDENTIFIER) {
      this.advance();
      return { type: "Identifier", name: token.value };
    }

    if (token.type === TokenType.LPAREN) {
      this.advance();
      const expr = this.parseExpression();
      this.expect(TokenType.RPAREN);
      return expr;
    }

    throw new Error("Unexpected token: " + token.value);
  }

  parse(): ASTNode[] {
    const statements: ASTNode[] = [];

    while (this.peek().type !== TokenType.EOF) {
      statements.push(this.parseStatement());
    }

    return statements;
  }

  private parseStatement(): ASTNode {
    const token = this.peek();

    if (token.type === TokenType.KEYWORD && token.value === "let") {
      return this.parseAssignment();
    }

    // Expression statement
    const expr = this.parseExpression();
    this.expect(TokenType.SEMICOLON);
    return expr;
  }

  private parseAssignment(): Assignment {
    this.expect(TokenType.KEYWORD);  // "let"
    const nameToken = this.expect(TokenType.IDENTIFIER);
    this.advance();  // "="
    const value = this.parseExpression();
    this.expect(TokenType.SEMICOLON);

    return {
      type: "Assignment",
      name: nameToken.value,
      value
    };
  }
}

// Example
const parser = new Parser(tokens);
const ast = parser.parse();
console.log(JSON.stringify(ast, null, 2));

Phase 3: Semantic Analysis

Semantic analysis checks that the program makes sense:

Copyclass SemanticAnalyzer {
  private symbolTable = new Map<string, Type>();
  private currentScope: Scope;

  analyze(ast: ASTNode[]): void {
    for (const node of ast) {
      this.analyzeNode(node);
    }
  }

  private analyzeNode(node: ASTNode): Type {
    switch (node.type) {
      case "NumberLiteral":
        return { kind: "number" };

      case "Identifier":
        const type = this.symbolTable.get(node.name);
        if (!type) {
          throw new Error("Undefined variable: " + node.name);
        }
        return type;

      case "BinaryOp":
        const leftType = this.analyzeNode(node.left);
        const rightType = this.analyzeNode(node.right);
        if (!this.typesMatch(leftType, rightType)) {
          throw new Error("Type mismatch in binary operation");
        }
        return leftType;

      case "Assignment":
        const valueType = this.analyzeNode(node.value);
        this.symbolTable.set(node.name, valueType);
        return valueType;

      default:
        throw new Error("Unknown node type");
    }
  }

  private typesMatch(a: Type, b: Type): boolean {
    return a.kind === b.kind;
  }
}

Phase 4: Intermediate Representation

Compilers use an intermediate representation (IR) for optimization:

Copy// Three-Address Code (TAC) IR
type TACInstruction =
  | { op: "assign"; dest: string; src: string | number }
  | { op: "add"; dest: string; left: string; right: string }
  | { op: "sub"; dest: string; left: string; right: string }
  | { op: "mul"; dest: string; left: string; right: string }
  | { op: "div"; dest: string; left: string; right: string };

class IRGenerator {
  private instructions: TACInstruction[] = [];
  private tempCounter = 0;

  private newTemp(): string {
    return "t" + this.tempCounter++;
  }

  generate(ast: ASTNode[]): TACInstruction[] {
    for (const node of ast) {
      this.generateNode(node);
    }
    return this.instructions;
  }

  private generateNode(node: ASTNode): string {
    switch (node.type) {
      case "NumberLiteral":
        return node.value.toString();

      case "Identifier":
        return node.name;

      case "BinaryOp": {
        const left = this.generateNode(node.left);
        const right = this.generateNode(node.right);
        const temp = this.newTemp();

        const opMap: Record<string, "add" | "sub" | "mul" | "div"> = {
          "+": "add", "-": "sub", "*": "mul", "/": "div"
        };

        this.instructions.push({
          op: opMap[node.operator],
          dest: temp,
          left,
          right
        });

        return temp;
      }

      case "Assignment": {
        const value = this.generateNode(node.value);
        this.instructions.push({
          op: "assign",
          dest: node.name,
          src: value
        });
        return node.name;
      }

      default:
        throw new Error("Unknown node type");
    }
  }
}

// Example: x = 10 + 20 * 30
// TAC:
// t0 = 20 * 30
// t1 = 10 + t0
// x = t1

Phase 5: Optimization

Optimizers transform IR to faster equivalent code:

Copyclass Optimizer {
  optimize(ir: TACInstruction[]): TACInstruction[] {
    let optimized = ir;
    let changed = true;

    while (changed) {
      changed = false;
      const newIR = this.constantFolding(optimized);
      if (newIR.length < optimized.length) {
        changed = true;
        optimized = newIR;
      }
      optimized = this.deadCodeElimination(optimized);
    }

    return optimized;
  }

  // Constant folding: evaluate compile-time constants
  private constantFolding(ir: TACInstruction[]): TACInstruction[] {
    const constants = new Map<string, number>();
    const optimized: TACInstruction[] = [];

    for (const instr of ir) {
      if (instr.op === "assign" && typeof instr.src === "number") {
        constants.set(instr.dest, instr.src);
        optimized.push(instr);
      } else if (["add", "sub", "mul", "div"].includes(instr.op)) {
        const leftVal = constants.get(instr.left);
        const rightVal = constants.get(instr.right);

        if (leftVal !== undefined && rightVal !== undefined) {
          // Both operands are constants, fold them!
          let result: number;
          switch (instr.op) {
            case "add": result = leftVal + rightVal; break;
            case "sub": result = leftVal - rightVal; break;
            case "mul": result = leftVal * rightVal; break;
            case "div": result = leftVal / rightVal; break;
          }
          constants.set(instr.dest, result);
          optimized.push({ op: "assign", dest: instr.dest, src: result });
        } else {
          optimized.push(instr);
        }
      } else {
        optimized.push(instr);
      }
    }

    return optimized;
  }

  // Dead code elimination
  private deadCodeElimination(ir: TACInstruction[]): TACInstruction[] {
    const used = new Set<string>();

    // Find all used variables
    for (const instr of ir) {
      if (["add", "sub", "mul", "div"].includes(instr.op)) {
        used.add(instr.left);
        used.add(instr.right);
      }
    }

    // Remove assignments to unused temps
    return ir.filter(instr => {
      if (instr.op === "assign" && instr.dest.startsWith("t")) {
        return used.has(instr.dest);
      }
      return true;
    });
  }
}

Phase 6: Code Generation

Finally, generate target machine code (here, x86-64 assembly):

Copyclass X86CodeGenerator {
  private assembly: string[] = [];
  private registerAllocator = new RegisterAllocator();

  generate(ir: TACInstruction[]): string {
    this.assembly.push("section .text");
    this.assembly.push("global _start");
    this.assembly.push("_start:");

    for (const instr of ir) {
      this.generateInstruction(instr);
    }

    this.assembly.push("  ; Exit");
    this.assembly.push("  mov rax, 60");
    this.assembly.push("  xor rdi, rdi");
    this.assembly.push("  syscall");

    return this.assembly.join("\n");
  }

  private generateInstruction(instr: TACInstruction): void {
    switch (instr.op) {
      case "assign":
        if (typeof instr.src === "number") {
          const reg = this.registerAllocator.allocate(instr.dest);
          this.assembly.push("  mov " + reg + ", " + instr.src);
        } else {
          const srcReg = this.registerAllocator.get(instr.src);
          const destReg = this.registerAllocator.allocate(instr.dest);
          this.assembly.push("  mov " + destReg + ", " + srcReg);
        }
        break;

      case "add": {
        const leftReg = this.registerAllocator.get(instr.left);
        const rightReg = this.registerAllocator.get(instr.right);
        const destReg = this.registerAllocator.allocate(instr.dest);
        this.assembly.push("  mov " + destReg + ", " + leftReg);
        this.assembly.push("  add " + destReg + ", " + rightReg);
        break;
      }

      case "mul": {
        const leftReg = this.registerAllocator.get(instr.left);
        const rightReg = this.registerAllocator.get(instr.right);
        const destReg = this.registerAllocator.allocate(instr.dest);
        this.assembly.push("  mov rax, " + leftReg);
        this.assembly.push("  imul rax, " + rightReg);
        this.assembly.push("  mov " + destReg + ", rax");
        break;
      }
    }
  }
}

// Register allocator - simplified linear scan
class RegisterAllocator {
  private registers = ["rax", "rbx", "rcx", "rdx", "rsi", "rdi", "r8", "r9"];
  private allocation = new Map<string, string>();
  private nextReg = 0;

  allocate(variable: string): string {
    if (this.allocation.has(variable)) {
      return this.allocation.get(variable)!;
    }

    const reg = this.registers[this.nextReg % this.registers.length];
    this.nextReg++;
    this.allocation.set(variable, reg);
    return reg;
  }

  get(variable: string): string {
    if (!this.allocation.has(variable)) {
      throw new Error("Variable not allocated: " + variable);
    }
    return this.allocation.get(variable)!;
  }
}

Putting It All Together

Copyclass Compiler {
  compile(source: string): string {
    // 1. Lexical analysis
    console.log("Lexing...");
    const lexer = new Lexer(source);
    const tokens = lexer.tokenize();

    // 2. Parsing
    console.log("Parsing...");
    const parser = new Parser(tokens);
    const ast = parser.parse();

    // 3. Semantic analysis
    console.log("Semantic analysis...");
    const analyzer = new SemanticAnalyzer();
    analyzer.analyze(ast);

    // 4. IR generation
    console.log("Generating IR...");
    const irGen = new IRGenerator();
    const ir = irGen.generate(ast);

    // 5. Optimization
    console.log("Optimizing...");
    const optimizer = new Optimizer();
    const optimizedIR = optimizer.optimize(ir);

    // 6. Code generation
    console.log("Generating assembly...");
    const codeGen = new X86CodeGenerator();
    const assembly = codeGen.generate(optimizedIR);

    return assembly;
  }
}

// Usage
const compiler = new Compiler();
const program = "let x = 10 + 20 * 30;";
const assembly = compiler.compile(program);
console.log(assembly);

Output assembly:

Copysection .text
global _start
_start:
  mov rax, 20
  imul rax, 30
  mov rbx, rax
  mov rcx, 10
  mov rcx, rcx
  add rcx, rbx
  mov rdx, rcx
  ; Exit
  mov rax, 60
  xor rdi, rdi
  syscall

Conclusion

Compilers are the bridge between human thought and machine execution. Understanding them makes you a better programmer.

Key takeaways:

• Compilation is a multi-phase pipeline
• Each phase has a specific responsibility
• IR enables target-independent optimization
• Real compilers use sophisticated algorithms (graph coloring for register allocation, SSA for optimization)

Modern compilers like LLVM and GCC are marvels of engineering with millions of lines of code. But at their core, they follow the same principles we explored here.