Re: regex with boolean operations over character classes built_in on DCG
Michael Hendricks <[email protected]> Fri, 1 Aug 2014 07:51:26 -0600
| Newsgroups | gmane.comp.ai.prolog.swi |
|---|---|
| Message-ID | <CAFHuXuZY+vzD08svTAYehqu2B2pbB9yOK57t2RJeHprhBoPjew@mail.gmail.com> |
On Fri, Aug 1, 2014 at 3:34 AM, Kuniaki Mukai <[email protected]> wrote: > I have completely rewritten my old codes for regex in SWI-Prolog DCG, so > that > now it is working stable on SWI-Prolog develop version. > > Features are: > 1. Character classes > 2. Boolean operations > 3. States are minimized as taught in automata theory. > 4. Built_in on DCG. > 5. Hybrid syntax of unix-like regex and prolog terms. > 6. regex expressions are term-expanded on being read. > 7. No runtime library needed except generated predicates as state labels. > This is intriguing. Is the source code available somewhere for us to see? -- Michael -------------- next part -------------- HTML attachment scrubbed and removed