Josiah Carlson <[EMAIL PROTECTED]> wrote:
Another concern that actually popped up on the Python bug tracker is what
family of regular expression engine is it? Is it a recursive
descent regular expression engine (so can have O(2^n) performance
characteristics like Perl and Python) or is it a of the Thompson
familywhich could perform in O(n^2) time in the worst case
(http://swtch.com/~rsc/regexp/regexp1.html)?
Sadly, it's a recursive descent. But so is the current one in Scintilla, so
at least it wouldn't make matters worse in this respect. If
pathological-expression performance is of primary concern, then it'd clearly
be better to keep the current simple engine for now, and wait until someone
has time to build a proper Thompson-type engine - it'll be easier to
maintain compatibility with the current simpler syntax when building the new
engine.
--Mike
_________________________________________________________________
With tax season right around the corner, make sure to follow these few
simple tips.
http://articles.moneycentral.msn.com/Taxes/PreparationTips/PreparationTips.aspx?icid=HMFebtagline
_______________________________________________
Scintilla-interest mailing list
[email protected]
http://mailman.lyra.org/mailman/listinfo/scintilla-interest
