Set operations on regular languages can be efficiently performed by means of algorithms operating on Finite Automata.
The expressions declared in RLA are therefore translated into minimum state Deterministic Finite Automata whose references are stored in the Symbol Table as values corresponding to input symbols or identifiers.
Finite Automata are implemented by the class Autom declared in Autom.java, that actually replaces the class Symb introduced in the previous section.
The Equiv class declared in Equiv.java looks for equivalent states in a DFA in order to perform state minimization.
The tranlator for RLA is specified in rla.cup.
The output reported in TranslationResult.txt will be printed on the Java console.