SL>           putchar((a>4));
 SL> 
 SL> You should be able to figure out how to transliterate this into 
 SL> rexx.

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

I don't have a lot of experience with REXX but, from what I've seen so far,
it seems that HOW you choose to represent values is critical to determining
which operations are easy and which are difficult.

'a' and 'b' represent bytes that could be held in decimal strings
("0" through "255"), hex strings ("00"
through "FF"), binary strings ("00000000" through
"11111111"), single characters ('00'x through 'FF'x), etc.

If a and b are decimal strings then a>4 is b/16.

Hex strings might use B2X(RIGHT(X2B(a),6)||"00") and
"0"||LEFT(b,1).

Binary strings could be RIGHT(a,6)||"00" and "0000"||LEFT(b,4).

Single characters might use D2C((C2D(a)*4) % 256) and D2C(C2D(b)/16).

No idea which representation is best for the UU algorithm, usually I just
start with one approach and keep changing until I find the representation
that I hate the least.

Bill


--- Maximus/2 2.01wb