"Mike Roberts" <[EMAIL PROTECTED]> wrote: > I've been integrating Scintilla into a project of mine that has its own > regular expression engine. Since my RE engine is visible to my users in > other contexts, I felt it would be best to use it as the RE engine for my > Scintilla integration as well - otherwise my users would have to remember > two RE syntaxes, and when to use which. So, I did a little massaging of my > engine's interface, and now it can be used as a drop-in replacement for > Scintilla's current RE engine.
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)? Just curious. - Josiah _______________________________________________ Scintilla-interest mailing list [email protected] http://mailman.lyra.org/mailman/listinfo/scintilla-interest
