On 8-Aug-07, at 2:28 AM, Nick Maclaren wrote: > I have needed to push my stack to teach REs (don't ask), and am > taking a look at the RE code. I may be able to extend it to support > RFE 694374 and (more importantly) atomic groups and possessive > quantifiers. While I regard such things as revolting beyond belief, > they make a HELL of a difference to the efficiency of recognising > things like HTML tags in a morass of mixed text. +1. I would use such a feature. > The other approach, which is to stick to true regular expressions, > and wholly or partially convert to DFAs, has already been rendered > impossible by even the limited Perl/PCRE extensions that Python > has adopted. Impossible? Surely, a sufficiently-competent re engine could detect when a DFA is possible to construct? -Mike
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