In a message on 01-06-95, Peter Hansen said to Mark Shumway:

MS> So, how does one go about translating the shift-bit operations into
MS> REXX? 

PH> One way that springs to mind is a lookup table faked using stem
PH> variables.  There are probably better options.

Duh.  And of course there _is_ a much better option and I was asleep at
the switch.  Rest assured that I have never use a lookup table to
implement bit-shifting operations...  in fact, my cat typed that
response.  Yeah, that's it...

As Stephen Lindholm pointed out:
SL> Divides and multiplies. 

Of course, if you were trying to implement bit *rotation* then my
response would have been more useful... :-)
___
 * MR/2 * Now cruising at Warp 3!

--- QScan v1.131b / 01-0348