在线练习内容

Compiler
Regex => NFA Convert simple regular expressions to nondeterministic finite automaton.
Regex => NFA => DFA Convert simple regular expressions to deterministic finite automaton.
Regex => NFA => DFA => Min-DFA Convert simple regular expressions to minimum deterministic finite automaton.
Left factoring Left factoring.
Left recursion Try to eliminate left recursion.
CFG => LL(k) Try to convert context-free grammar to LL(k) class.
CFG => CNF Try to convert context-free grammar to Chomsky normal form.
First & Follow Compute first and follow sets for context-free grammars.
LL(1) Construct parsing table and automaton for LL(1) grammars.
LR(0)/SLR(1) Construct parsing table and automaton for LR(0)/SLR(1) grammars.
LR(1) Construct parsing table and automaton for LR(1) grammars.
LALR Construct parsing table and automaton for LALR grammars.
CYK Construction of parsing tables using CYK algorithm for CNF grammars.