Re: Exposing regexp engine & compiled regexp's by Damian Conway- January 8, 2001 > I once brutalized Henry Spencer&39;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 they typed something > that broke the match, I could beep and disallow the character. > > I was just a greenhorn then, so it coredumped. But it&39;s another use > for access to internal engine states and failure reasons.Good point. Perhaps, on failure, a regex could.http://www.nntp.perl.org/group/perl.perl6.language.regex/2001/01/msg583.html Re: Exposing regexp engine & compiled regexp's by Filipe Brandenburger- January 8, 2001 Damian wrote: > > I once wrote a C++-based regex engine (much simpler than Perl&39;s!) > just like this. > > Knowing why a regex failed is invaluable when matching regexes > against file streams, but there are more possibilities than you > mentioned: > > "Failed" Did not match because of illegal transition > > "Short" Did not match: did not reach acceptor state > > "Exact" .http://www.nntp.perl.org/group/perl.perl6.language.regex/2001/01/msg582.html Re: Exposing regexp engine & compiled regexp's by Nathan Torkington- January 6, 2001 Damian Conway writes:> I once wrote a C++-based regex engine (much simpler than Perl&39;s!)> just like this.I once brutalized Henry Spencer&39;s engine into telling me when I wason my way to a match. This was for a UI: I wanted to be able to saythat the input should only match this RE, and if they typed somethingthat broke the match, I could beep and disallow the character.I was just a greenhorn then, so it coredumped. But it&39;s another usefor access to internal engine states and...http://www.nntp.perl.org/group/perl.perl6.language.regex/2001/01/msg581.html Re: Exposing regexp engine & compiled regexp's by Damian Conway- January 6, 2001 > 1. I think it should be possible to have incomplete matches&39;&39;. > > Regexp&39;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 > would be possible to find out in which state the NFA has stopped, > and it would also be possible to start another match from > that state on.I once wrote a...http://www.nntp.perl.org/group/perl.perl6.language.regex/2001/01/msg580.html Exposing regexp engine & compiled regexp's by Filipe Brandenburger- January 5, 2001 Hello.I have some ideas (actually a wishlist) for the regular expressionsubsystem (that&39;s what it&39;ll be, right). I would appreciate ifperl6&39;s regexp engine exposes the maximum possible interfaces, andI&39;ll expose why I think this would be nice.1. I think it should be possible to have incomplete matches&39;&39;. Regexp&39;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.http://www.nntp.perl.org/group/perl.perl6.language.regex/2001/01/msg579.html |