John sent this to me.

And the answer to his question (see below) is:
Uhhh, yeah , I guess I miscounted.

---------- Forwarded message ----------
Date: Fri, 13 Mar 1998 22:50:46 -0600 (CST)
From: John Payson <supercat@Mcs.Net>
To: sdattalo@unix.sri.com
Subject: Re: Parity Challenge

>
> It's been a while since there's been a challenge. And since there's
> been a bunch talk about RS232 stuff, I thought it might be appropriate
> if we had a really fast parity generator for those software bit-banging
> UARTs.
>
> So here's the challenge:
> Given the variable X, write a routine that computes the odd-parity
> of X.

        swapf   X,w
        xorwf   X,f
        rrf     X,w
        xorwf   X,f
        btfsc   X,2
        incf    X,f

This version will leave the parity in X.0 while blenderizing most of the
rest of X.  Is that what you had in mind?