CFG Language Analyzer

Arithmetic Expression Parser & Derivation Tree Visualizer

Context-Free Grammar

Recursive-descent compiler matching these rules:

EXPR -> EXPR + TERM | EXPR - TERM
EXPR -> TERM
TERM -> TERM * FACTOR | TERM / FACTOR
TERM -> FACTOR
FACTOR -> (EXPR)
FACTOR -> NUM
NUM -> NUM DIGIT
NUM -> DIGIT
DIGIT -> 0 | 1 | 2 | ... | 9
Expression Workspace

Enter statement with numbers, + - * /, and ( ).

Quick Test Cases
Active Derivation View
Parser Position Tracker
Enter expression and click Analyze...
Compiler Call Stack
Empty Stack
Timeline Controls
Step 0 of 0
Execution Tracing

Click a parsing step below to seek directly to that point.

Interactive Parse Tree

💡 Drag canvas to pan. Scroll to zoom. Hover over nodes to highlight tokens in expr.

Project #2: CFG Language Analyzer | Automata Theory & Compiler Design Visualizer