On Thu, Sep 04, 2003 at 08:43:31PM -0400, Terry Reedy wrote: [...] > I think the following version of the last four lines is correct and > clearer. > > As the target string is scanned, REs separated by "|" are tried from > left to right. When one pattern completely matches, that branch is > accepted. This means that once A matches, B will not be tested > further, even if it would produce a longer overall match. Well IMHO this one is better, thanks. [...] > Doc bugs like this can (and should be) reported on SourceForge just > like program bugs. > http://sourceforge.net/tracker/?group_id=5470 I'll do it. I think it can be clearer. ps. Thanks to Bob Halley for excellent explanation with the code ;-) -- [ Wojtek Walczak - gminick (at) underground.org.pl ] [ <http://gminick.linuxsecurity.pl/> ] [ "...rozmaite zwroty, matowe od patyny dawnosci." ]
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4