parses and groups elements inside the definition of a finite automaton, defined by the following backus naur form
state ::= [a-zA-Z]+
set_of_final_states ::= "final states" = {state}
simbol ::= [a-zA-Z]
transition_arrow ::= "(" simbol ")" "->"
transition ::= state transition_arrow state