Hi everyone, i’m looking for someone that helps me w/ a basic regex to NFA compiler because i’ve a lot of doubts about it.
For NFA do you mean Nondeterministic Finite Automaton?
Also anytime I see the words Prolog and RegEx together I personally tend to think DCG.
SWI-Prolog does have a Regular Expression package.
L-FLAT - Logtalk Formal Language and Automata Toolkit