On Sun, Aug 18, 2013 at 8:04 PM, Richard A. O'Keefe o...@cs.otago.ac.nzwrote:
The argument for twos-complement, which always puzzled me, is that the
other
systems have two ways to represent zero. I never found this to be a
problem,
not even for bitwise operations, on the B6700. I *did*
Because of laziness, you do in a sense only take the first successful
value. When I've made parser combinators for Python before, I've used
either generators or exceptions to get lazy evaluation, since computing the
whole list of possibilities for each bind would ruin the running time of
the
