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.

Problem

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Audience

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Market

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Pricing

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.