Convert any regular grammar to NFA and DFA and get the image of the corresponding graph.
Also check if an input string belongs the language described by the regular grammar.
grammar_input.json file is the input of the program.
Given this grammar:
A->aA
A->aB
B->bB
B->b
The generated graph for NFA is:
and the output graph for DFA is:
