Compiler Pipeline Simulator

Compiler Pipeline

Compilation speed 1.0×

Code complexity medium

Optimization level O2

Throughput

–

Tokens compiled

–

Dead code eliminated

–

Current stage load

–

How it works

Every colored block is one lexical token spawned from a simulated source line. Tokens travel at a constant rate through five fixed pipeline stages — lexer, parser, semantic analysis, optimizer, and code generator — exactly as a real compiler's phases process a token stream in sequence, never skipping ahead of one another. At the optimizer gate, a fraction of tokens marked "redundant" (dead stores, unreachable branches, constant-folded operators) are removed from the stream entirely rather than passed through, visualizing dead-code elimination.

throughput = complexity × speed   (tokens/s)
p(eliminate) = 0.12 × optLevel      (per redundant token at the optimizer gate)
stage(token) = floor(distance(token) / stageLength)

Compilation speed — how fast tokens move down the pipeline; mirrors compiler throughput on faster hardware or a simpler front end.
Code complexity — how densely tokens spawn from the source, i.e. how much code is being fed in per second.
Optimization level — from O0 (no elimination) to O3 (aggressive); higher levels remove more redundant tokens at the optimizer gate, shrinking what reaches code generation.
Stage labels — toggle the floating stage name tags above each platform.

Real-world relevance: this five-stage shape — lex, parse, analyze, optimize, generate — is the textbook structure shared by GCC, LLVM/Clang, javac and virtually every production compiler, even though each implements dozens of passes inside "optimize" alone.

Keyword token Identifier token Operator token Literal token Eliminated (dead code)

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.