bonginn/parselab ☆ — stars

$ parselab

Compiler construction tools — FIRST/FOLLOW, LL(1), LR parsers, automata, and more. Everything runs locally in your browser.

Available
FIRST / FOLLOW Compute FIRST and FOLLOW sets for any context-free grammar. →
LL(1) Parsing Table Build the LL(1) parsing table and detect conflicts with a clear visual diff. →
Grammar Transformer Eliminate left recursion and apply left factoring, with step-by-step output. →
CFG → CNF Convert a grammar to Chomsky Normal Form in five labelled steps: START, DEL, UNIT, TERM, BIN. →
Regex → NFA Build an ε-NFA from a regular expression using Thompson's construction. Visualised with Graphviz. →
NFA → DFA Powerset construction: convert an ε-NFA to a DFA with a step-by-step subset table. →
CYK Parser Check if a string belongs to a CNF grammar and visualise the full DP parse table. →
DFA Minimization Minimize a DFA with the table-filling algorithm. Shows the distinguishability table and merged equivalence classes. →
On the roadmap
LR(0) SLR(1) LR(1) LALR