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.

MirkoBonadei / Regexp-NFA-Prolog-Compiler Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

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.