Various converters, involving concepts from languages and grammars.
Available so far :
-
Regular Expression to Non-deterministic Finite Automata converter
-
Right Linear Grammar to Finite State Machine converter
-
Push Down Automata to check for a palindrome
[Done as part of my Compiler Engineering Lab (CCS605) work]