⚙ Theory of Computation

CFG Simplifier

Eliminate useless symbols from context-free grammars with step-by-step analysis and language preservation verification.

✏️
Enter Context-Free Grammar
💡 One rule per line  ·  Use -> for productions  ·  Use | for alternatives
Parse
›
Generating
›
Non-Generating
›
Reachable
›
Unreachable
›
Simplified
›
Verify
📄
Original CFG
✅
Generating Symbols
Variables that can derive terminal strings
🔗
Reachable Symbols
Symbols reachable from start symbol
🗑️
Removed (Useless) Symbols
✨
Simplified CFG
🔍
Language Preservation Verification