Hello Michel, Michel Pelletier wrote: > I have written up a rough draft PEP on bytecode verification: > > http://www.python.org/peps/pep-0330.html just allow me a quick remark: (len(co_code) < sizeof(unsigned char) - 1) == (len(co_code) < 0) which might not be what you want. I suppose you are aiming for an expression involving UCHAR_MAX. Thanks, Michael > I also have a sketch implementation written in Python that I have uploaded: > > http://www.daca.net:8080/verify.tgz > > This implementation does not really work yet, and there are only a couple of > unit tests, mostly because I am not a bytecode expert, but I think the > framework is pretty close to being usable and I'm getting a better grasp on > the issue. It is based on the algorithm posted by Phillip Eby, and feedback > on it would be great. > > -Michel > > _______________________________________________ > Python-Dev mailing list > Python-Dev at python.org > http://mail.python.org/mailman/listinfo/python-dev > Unsubscribe: http://mail.python.org/mailman/options/python-dev/cm%40leetspeak.org >
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