There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
This is a project I have developed for a University Exam. It is a Prolog compiler which is able to generate a Nondeterministic Finite Automata from a well-formed RegExp. It is also able to prove if a String is accepted by the language defined by the NFA.