All very good ideas that may come in handy one of these days. I appreciate all the replies! What I ended up with is a table like:

char code ascii[] = {
0x20,0x00,0x00,0x00,0x00,0x00, // space
0x21,0x00,0x00,0x00,0x00,0x00, // !
0x22,0x00,0x00,0x00,0x00,0x00, // "
0x23,0x00,0x00,0x00,0x00,0x00, // #
0x24,0x00,0x00,0x00,0x00,0x00, // $
etc etc etc etc etc etc
0x7C,0x00,0x00,0x00,0x00,0x00, // |
0x7D,0x00,0x00,0x00,0x00,0x00, // }
0x7E,0x00,0x00,0x00,0x00,0x00, // ~
0x00,0x00,0x00,0x00,0x00,0x00 // ASCII ERROR (Prints box)

Note the above examples don't contain the actual map yet...just the organization. The pointer math is simplified a bit and results in much faster entry lookup. About 576 bytes for the standard english stuff.

Thanks for sharing what info you had!
Mark