Simple projects for learning and discovering finite automatas and LL(1) grammars.
Features:
- Define alphabets
- Define NFA and DFA automatas
- Convert NFA to DFA
- Check strings againts automata
- Find all possible paths for an output
Features:
- Define grammar by adding instructions
- Check if the grammar is LL(1)