Neal Norwitz wrote: > On 12/24/05, Tim Peters <tim.peters at gmail.com> wrote: > > [...] >> >> The code up to the first failure is short: >> >> >> >> bom = '\xef\xbb\xbf' >> >> compile(bom + 'print 1\n', '', 'exec') > >> That sets `a` to point at the start of the string, `b` to point at the second character, and returns type==51. Then `len` >> is set to 1, `str` is malloc'ed to hold 2 bytes, and `str` is filled in with >> "\xef\x00" (the first byte of the input, as a NUL-terminated C >> string). > > This gives me an idea (ie, wild ass guess). r39680 checked in on > 2005-10-06 to speed up unicode charmap decoding. Dunno if it's likely or not. Gotta run, I'm headed east. Good luck. Other candidates might be the patches to Parser/tokenizer.c. (Unfortunately I don't have a machine to test this right now). Bye, Walter Dörwald
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