Browse Prior Art Database

Message And Menu Tables Compaction/ Compression

IP.com Disclosure Number: IPCOM000048508D
Original Publication Date: 1982-Feb-01
Included in the Prior Art Database: 2005-Feb-08
Document File: 2 page(s) / 32K

Publishing Venue

IBM

Related People

Cason, WC: AUTHOR [+2]

Abstract

Messages and menus are accessed by eight character symbolic names. As shown in the figure, four tables A, B, C, and D make up any message module generated. Table A contains a two menu within Table B form the start of Table B. The length of a message is computed by subtracting its pointer from the one that follows it. Null entries may exist; i.e., the points contain the same value. This occurs when a shared slot could not be filled because no symbolic name could be resolved to it. Table A also contains a two-byte header defining the number of entries in the table.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 58% of the total text.

Page 1 of 2

Message And Menu Tables Compaction/ Compression

Messages and menus are accessed by eight character symbolic names. As shown in the figure, four tables A, B, C, and D make up any message module generated. Table A contains a two menu within Table B form the start of Table
B. The length of a message is computed by subtracting its pointer from the one that follows it. Null entries may exist; i.e., the points contain the same value. This occurs when a shared slot could not be filled because no symbolic name could be resolved to it. Table A also contains a two-byte header defining the number of entries in the table.

Table B is a table of bit strings which represent the messages and menus accessible to the system from that module. These bit strings are made up of variable length code words from 2 to 12 bits long. When these code words are decoded, one at a time using Table C, the results from the decoding are stored sequentially in a buffer that was passed by the code requesting the message.

Table C is a compare table with three fields. The first is a 12-bit compare mask. The second is a 4-bit length field defining the code word length. This field is used to compute the start of the next code word when the previous one has been processed. The third field is one byte long, and may serve either of two purposes: if the high-order four bits are ones, it defines one 14 special functions; otherwise, it is the length of the word or phrase associated with it in Table D. The sta...