GitHub - MirkoBonadei/Regexp-NFA-Prolog-Compiler: 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.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.gitignore		.gitignore
re-nfa.pl		re-nfa.pl
test.plt		test.plt

About

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.