I saw this neat blog post on Planet Perl. I got to think about an idea.
Sounds like a good basis for implementing Prolog! Is there a simple way to compile unification/backtracking in a Prolog program to a Regular Expression?
I should write some code before asking, but I can't be the first (or the fiftieth) person to think of this. You could call other RE:s from the inserted code (the inserted code needs a functionality to fail).
I did search perlmonks and didn't find anything.
In reply to Using RegExp backtracking to implement Prolog? :-) by BerntB
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |