> 1. I think it should be possible to have ``incomplete matches''.
>
> Regexp's are interpreted by a NFA, that is a state machine.
> I think it would be nice if, when I try to match a regexp against
> a string, and the string ends before the regexp matches, it
>
Damian Conway writes:
> I once wrote a C++-based regex engine (much simpler than Perl's!)
> just like this.
I once brutalized Henry Spencer's engine into telling me when I was
on my way to a match. This was for a UI: I wanted to be able to say
that the input should only match this RE, and if the
