cdparra / afgen

AFGEN is a midterm university project from the "Compilers Design" class of Computers Engeneering career at the Politecnic Faculty of the National University of Asuncion, Paraguay. The idea is to create a Regular Expression converter to the equivalent Non-Deterministic Finite Automaton (NFA), following the Thompson Algorithm and using a Syntax-Directed Translation engine of one pass. With the NFA, we use the Subset Construction algorithm to obtain the corresponding DFA, which is then minimized to finally get the Reduced DFA. The Reduced DFA is used to simulate a String Validation process that validate if an input string belong to the language defined by the original Regular Expression.