Welcome to LFC Playground

A collection of tools for Formal Languages and Compilators course

Context-Free Grammars

First & Follow Sets

Calculate First and Follow sets for your context-free grammar

Try it

LL(1) Parsing Table

Generate LL(1) parsing table and check if your grammar is LL(1)

Try it

Left Recursion

Remove left recursion from your context-free grammar

Try it

Left Factoring

Apply left factoring to your context-free grammar

Try it

Chomsky Normal Form

Convert a context-free grammar to Chomsky Normal Form (CNF)

Try it

SLR Parsing Table

Generate SLR Automaton and parsing table with steps

Try it

LR(1) Parsing Table

Generate LR(1) automaton and parsing table with shift/reduce parsing

Try it

LALR Parsing Table

Generate LALR(1) automaton (merged LR(1) states) and parsing table

Try it

Finite Automata & Regex

Regex → NFA

Build an NFA from a regex using Thompson's construction with step-by-step details

Try it

Regex → DFA

Convert a regex directly to a DFA (Thompson + Subset Construction)

Try it

NFA → DFA

Convert NFA to DFA via subset construction with step-by-step details

Try it

Regex → Min-DFA

Convert a regex directly to its minimized DFA

Try it

DFA → Min-DFA

Minimize a DFA using partition refinement with step-by-step details

Try it

NFA → Min-DFA

Full pipeline: NFA → DFA → Min-DFA with all intermediate steps

Try it