|
⇤ ← Revision 1 as of 2010-03-05 16:08:29
Size: 327
Comment:
|
← Revision 2 as of 2010-03-05 16:11:44 ⇥
Size: 419
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| The largest part of the the 2to3 runtime is spent in the pattern matching algorithm. This currently uses a fairly naive back-tracking approach. Replacing it with an algorithm based on the computation of finite state machines out of the patterns should allow efficient simultaneous matching of patterns with many alternatives. | The largest part of the the [[http://wiki.python.org/moin/2to3|2to3]] runtime is spent in the pattern matching algorithm. This currently uses a fairly naive back-tracking approach. Replacing it with an algorithm based on the computation of finite state machines out of the patterns should allow efficient simultaneous matching of patterns with many alternatives. Interested students should contact martin@v.loewis.de. |
The largest part of the the 2to3 runtime is spent in the pattern matching algorithm. This currently uses a fairly naive back-tracking approach. Replacing it with an algorithm based on the computation of finite state machines out of the patterns should allow efficient simultaneous matching of patterns with many alternatives. Interested students should contact martin@v.loewis.de.