University Prolog and Common Lisp project that implements a regular languages compiler and NFA tester.
This project consists of two libraries (written in Prolog and Common Lisp) for regular expressions compilation into non-deterministic finite state automatas and for their testing.
Each of the two folders, Prolog and Lisp, contain a file, respectively nfa.pl and nfa.lisp (the two versions of this project), along with their respective README.txt file (Prolog README.txt and Lisp README.txt). Please see them for further information about how to use correctly the two interpretable source code files.
The nfa.pl file is a Prolog library for regular expressions compilation into non-deterministic finite state automatas and for their testing. For further information, please see the Prolog README.txt file.
The nfa.lisp file is a Common Lisp library for regular expressions compilation into non-deterministic finite state automatas and for their testing. For further information, please see the Lisp README.txt file.
- Emacs - Editor for both Prolog and Common Lisp versions of the project
- SWI-Prolog - Prolog prompt for testing
- LispWorks - Common Lisp prompt for testing