Bart³omiej Wo³owiec <[EMAIL PROTECTED]> wrote: > > For some time I'm interested in regular expressions and Finite State Machine. > Recently, I saw that Python uses "Secret Labs' Regular Expression Engine", > which very often works too slow. Its pesymistic time complexity is O(2^n), > although other solutions, with time complexity O(n*m) ( O(n*m^2), m is the > length of the regular expression and n is the length of the text, > introduction to problem: http://swtch.com/~rsc/regexp/regexp1.html ) [snip] > In addition to Google Summer of Code I would willingly write a faster > implementation of regular expressions in Python. Naturally, the > implementation would be 100% compatible with the existing regexp engine. > What do you think about my proposition?
Submit it as a Google Summer of Code project. - Josiah _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
