ZA200208653B - A method for bit-map parsing using a cobol algorithm. - Google Patents

Description

A METHOD FOR BIT-MAP PARSING USING A COBOL ALGORITHM : SPECIFICATION / PRIORITY APPLICATION

This application claims priority to United States provisional application senal number 60/201,559, filed on May 1, 2000, and entitled “BIT-MAP

PARSING USING COBOL ALGORITHM,” which is hereby incorporated by reference.

BACKGROUND QF THE INVENTION

The present mvention relates to financial transaction card messages and more specifically to “bit-mapped” messages or, in other words, messages which (1) may consist of a number of different identifiable components, any one of which may or may not be present in a given message; or (2) contain a bit-map of the components, the latter being a string of binary bits, each representing one potential component. Generally, the bit-map is placed at the front of the message as a header.

A value of one indicates the presence of the corresponding component in the message; a value of zero indicates the component’s absence.

For example, the ISO 8583-1993 specification (for financial transaction card originated messages, incorporated herein by reference) defines 128 distinct elements whose presence or absence in any message is indicated by a 128-bit- map in the message. One of the objectives of ISO 8583-1993 is to allow for the transmission of messages having different or varying sizes so that messages having a length longer than necessary are not sent. Each message may have a different size and each may have fields the others do not. The assortment of fields, therefore, varies from one message to another and these “floating” fields make it more difficult to ’ ] 25 extract data from the messages. The bit-map, which indicates the presence or absence of a particular field, allows for the proper extraction of data.

In connection with the processing of financial transaction messages, however, in which the COBOL language is utilized, because COBOL statements are not well suited to examine bits in a message, the use of a bit-map cannot presently be efficiently utilized.

For processing by a COBOL program, therefore, it is necessary to i convert the bit-map into a *“‘character-map,” an array having one byte (rather than one bit) per component. This allows the COBOL program to test for the presence of any J element with a simple subscript or index. For example, present elements could be represented by an “X”, absent elements could be represented by a space in this array.

In the past, there were many different ways to use bit-map data. For instance, provided below are descriptions of the division, subtraction, serial search, binary search, and evaluate processes used previously.

A. 1. Division

Bit-map data are moved four bytes at a time into a numeric area. Each resulting numeric value is then repeatedly divided by two. After each division, the remainder is examined. If the remainder is one, the corresponding character-map flag is set to “X”; if the remainder is zero, the flag is left as a space.

B. 2. Subtraction

Bit-map data are moved one byte at a time to a numeric area. Each resulting numeric value is compared against 128, then 64, then 32, 16, 8,4, 2, and 1.

Whenever a greater-than-or-equal is met, a corresponding characier-map flag is set to “XX”; and the value 128, 64, 32, etc. is subtracted from the number.

C. 3. Serial Search

Bit-map data are used, byte by byte, as search arguments into a table of:

Bit patterns (X’00°, X°01°, X02’, X’03, etc.) and corresponding eight-byte character patterns (‘000000D0O¢, ‘0000000X°, ‘ooooooXo, ‘0oooanXX’, ete). a

COBOL ’s “SEARCH” verb is used to perform a serial search of the table. When a hit is found on a bit pattern, the corresponding character pattern 1s moved into the character-map.

D. 4. Binary Search

Bit-map data are used, byte by byte, as in the serial search above; but

COBOL'’s “SEARCH ALL” verb is specified to perform a binary search of the table.

E. S. Evaluate ‘ 5 The bit-map data are taken a byte at a time. Each byte is compared against all 256 possible values (X’00°, X’01°, X’02’, ... X‘FF’). COBOL’s “EVALUATE?” verb tests for the presence of one of many mutually exclusive conditions. EVALUATE is used here to determine which of 256 possible bit patterns matches one byte of the bit-map. When a match is found, the corresponding character

C10 pattern CLS LUXS LUX LL XXD ete. — up to CC XXXXXXXX ds moved into the character map.

Despite these techniques, there is a need to develop an efficient technique that effectively extracts data from bit-map messages using COBOL statements.

SUMMARY OF THE INVENTION

According to the present invention, therefore, there is provided a new technique utilizing fewer lines of code and yet executing at a significantly faster rate.

In accordance with a preferred embodiment of the invention, there is provided a new method for extracting data from bit-map messages using COBOL statements, where the messages have one of many possible bit-map combinations representing messages of varying fields and lengths. The preferable method comprises the steps of: assigning a numeric value for each possible bit-map combination; generating a conversion table associating a byte-map for each of the values; identifying a bit-map within a particular message; converting the bit-map into an associated byte-map; and determining, based on the resulting byte-map, the absence or presence of the data. Preferably, the conversion step includes generating a

B particular numeric value for the bit-map and associating the byte-map to the bit-map . in accordance with the conversion table.

This new technique has been shown to be significantly faster of execution than any previous algorithm:

1. The division parse took 75 to 88 times as long as the new algorithm (depending on the message mix) 2. Subtraction took 5.9 to 8.9 times as long 3. Serial search took 21.9 to 82.5 times as long . 4. Binary search took 27.5 to 31.8 times as long 5. Evaluate took 6.9 to 32.1 times as long.

Moreover, because the present invention results in the fewest lines of code, it is easier to maintain.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing brief description as well as further objects, features, and advantages of the present invention will be understood more completely from the following detailed description of the presently preferred, but nonetheless illustrative, embodiments of the invention, with reference being made to the accompanying figure, in which:

FIGURE 1 1s an illustration showing the sequence of preferred steps to accomplish extraction of data in accordance with the present invention.

While the subject invention will now be described in detail, it 1s done so in connection with a preferred embodiment. It is intended that changes and modifications can be made to the described embodiment without departing from the true scope and spirit of the subject invention as defined by the appended claims.

DETAILED DESCRIPTION OF THE EMBODIMENTS OF THE INVENTION

The present invention relates to computer programming and techniques and in particular to programming in COBOL (Common Business Oriented Language), a working knowledge of which is assumed. For instance, in the programming code presented below, in COBOL “PIC” is a clause used to describe the contents of an elementary data item, in this case 400-P and 400-P-X, and “X” 1s a data character symbol which is alphanumeric, “9” is a data character symbol which is numeric, “S” indicates an operational sign and a number in parenthesis indicates the digit length of the item.

In accordance with a preferred embodiment of the invention a process is provided whereby data may be extracted from bit-map messages using COBOL statements. A two-byte area is defined in WORKING STORAGE (or a work area for storing intermediate results and constants that will be used in the program) as both i 5 alphanumeric and numeric: 05 400-P PIC S94) COMP VALUE 0. 05 REDEFINES 400-P.

PIC X. 10 400-P-X PIC X. 10 Bit-map data are moved, one byte at a time, into a field 400-P-X. Each resulting numeric value (in 400-P) is used as a subscript into a table of corresponding character-patterns, each eight characters long (‘00000000 ‘0000000X°, ‘0aO0cooXo’, ‘aooooaXX’, etc.). These eight characters are then moved into the appropriate position in the character-map, and then data can be extracted from the message in accordance with the character map.

Preferably, bytes of the bit-map are individually named, rather than being selected by subscript, since this has been shown to be a more efficient method.

Figure 1 illustrates the sequence of preferred steps to accomplish extraction of data from messages having floating fields. The messages have a header bit-map of 128 bits viewed as 16 bytes (10). Each byte will have a binary value which will vary from 00000000 to 11111111. As mentioned above, the bit-map is broken down into a two byte area (12) in memory defined as alphanumeric. The first byte (14) is always a binary 00000000. The second byte (16) receives a byte from the bit map (indicated in Figure 1 by the arrow (16)). The second byte therefore receives abinary value between 00000000 and 11111111 inclusively.

In the next preferred step, a redefinition occurs where the same two memory positions 14, 16 are redefined as a numeric in PIC 9(4) COMP having a : value that will vary from hex 0000 through O0FF (0 through 255 decimal). This numeric value is then used as an index into a table (18) containing 256 entries of 8 bytes each. For instance, a value of hex 0000 will point to the first row of eight spaces. A value of hex O0FF will point to the 256th row of XXXXXXXX. In the figure, arrow (20) points to the third row of eight spaces. Once the matching character pattern is determined the character map 22 is generated. This is an area in Co memory containing 16 groups of 8 bytes (128 bytes total). Each group receives an entry from the table 18. A } "Set forth below are ‘the preferred COBOL programming steps to be 3 5 utilized to carry out the preferred embodiment of the invention: - “~The following data structure defines the message to be parsed. It is in

ISO IPM format and is a typical of a bit-mapped message structure. (Note that the first subfield, MTL, is not material to this parsing technique.) Messages may be of variable length. - Lo oo } 01 IP66102-IPM-MSG © EXTERNAL. 05 [P66102-NORMAL-IPM-MSG.. ~~ . © . 10 IP66102-MTI _ PIC X(4). BN 10 0 IP66102-BIT-MAP. ~~ ~~

Po 15 IP66102-BIT-BYTE:1. PIC.X. . . . = 15 IP66102-BIT-BYTE-2 PIC X. =.=. 15 IP66102-BIT-BYTE-3 PIC"X. - ©. 15 IP66I02BIT-BYTE4 PICX. 15 IP66I02-BIT-BYTE-S PIC X.

Se {5 IP6610ZIBIT-BYTE-6" “PIC X. + ~~ =

Cen oso 015:01P66102-BIT BY TET PIC: Xove 15 IP66102-BIT-BYTE-8 PIC X. © 15 IP66102-BIT-BYTE-9 "PIC X. 0 ~ 0 115 IP66102-BIT-BYTE-10 PIC. X, - 23 15 P6GI02-BIT-BYTE-11 PIC X. 15 [P66102-BIT-BYTE-12 PIC X. : ~ 15 IP66102-BIT-BYTE-13. PIC X.. . 15 [P66102-BIT-BYTE-14 PIC X. ‘15 IP66102-BIT-BYTE-15 PIC"X. 15 IP66102-BIT-BYTE-16 PIC X. 10 TP66102-MSG-CONTENT PIC X(32747). : The following defines the items used in converting one byte of the bit- map into a ‘usable subscript. Sn uo Dole 0 oo 01 WORKING-VALUES! * = onic 0 on : 05.-- . 400 -.. ~~... PIC S34) COMP VALUEO. 05 REDEFINES 400-P. } 10 et PICK © 10. © 400PX.- ~~. PCX

The creation of the parsing pattern table 18 (byte-map) follows: 0! 500-PARSING-PATTERN-VALUES. oo 05 PIC X(8) VALUE' ' 05 PIC X(8) VALUE' X. : : : 05 PIC X(8) VALUE' X'. RT

Co 05 PIC X(8) VALUE' XX. - .. x 05 PIC X(8) VALUE' X'. EE 05 PIC X(8) VALUE' XX. =. .. - 05 PIC X(8) VALUE' XX' ~~ 05 PIC X(8) VALUE' XXX. DE 05 PIC X(8) VALUE' X '. . - : 05 PIC X(8) VALUE' XX. . . : 05 PICX(8) VALUE' XX'. - - - . So ~ 05 PIC X(8) VALUE' XXX. . ~~... oo 05 PICX(8) VALUE' XX' ~~ . . =... 05 PIC X(8) VALUE' XXX. . = . 05 PIC X(8) VALUE' XXX" =... Co RE 05 PIC X(8) VALUE' XXXX'.. ..- 05 PIC X(8) VALUE' X * cs © 05 PIC X(8) VALUE' X X. RT 05 PICX(8) VALUE' X X'. -. . .. 05 PIC X(8) VALUE' X XX. = «... . . .. ; 05 PICX(8) VALUE' XX" .. . —,. . 2 05 PIC X(8) VALUE' XXX. - -- ~~. 05 PIC X(8) VALUE' XXX" So . . 05 PIC X(8) VALUE' XXXX. .- 05 PICX(8) VALUE" XX '. ~~. 05 PIC X(8) VALUE' XX X. A 05 PIC X(8) VALUE' XXX. . Co 05 PIC X(8) VALUE' XX XX. I 05 PIC X(8) VALUE' XXX ' 05 PIC X(8) VALUE' XXX X. 05 PIC X(8) VALUE' XXXX'. 05 PIC X(8) VALUE ' XXXXX. 33 05 PIC X(8) VALUE' X oo 05 PIC X(8) VALUE' X X. 05 PIC X(8) VALUE' X X 05 PIC X(8) VALUE' X XX. 05 PIC X(8) VALUE' X X *. So 40 05 PIC X(8) VALUE" X XX" 05 PIC X(8) VALUE' X XX. B 05 PIC X(8) VALUE' X XXX" 05 PIC X(8) VALUE' XX '. E 05 PIC X(8) VALUE' XX X. 45 05 PIC X(8) VALUE' XXX".

05 PIC X(8) VALUE" X X XX". 05 PIC X(8) VALUE' X XX ". 05 PIC X(8) VALUE' X XX X'. 05 PIC X(8) VALUE' X XXX". 05 PIC X(8) VALUE' X XXXX'. 05 PIC X(8) VALUE' XX 05 PIC X(8) VALUE' XX X' 05 PIC X(8) VALUE' XX X'. 05 PIC X(8) VALUE' XX XX. 05 PIC X(8) VALUE' XX X ". 05 PIC X(8) VALUE" XX X X'. 05 PIC X(8) VALUE' XX XX". 05 PIC X(8) VALUE' XX XXX. 05 PIC X(8) VALUE' XXX '. 05 PIC X(8) VALUE' XXX X'. 05 PIC X(8) VALUE' XXX X. 05 PIC X(8) VALUE ' XXX XX. 05 PIC X(8) VALUE" XXXX ". 05 PIC X(8) VALUE' XXXX X.. 05 PIC X(8) VALUE ' XXXXX". 05 PIC X(8) VALUE ' XXXXXX'. 05 PIC X(8) VALUE'X 05 PIC X(8) VALUE'X X. 05 PIC X(8) VALUE'X X'. 05 PIC X(8) VALUE'X XX. 05 PIC X(8) VALUE'X X ". 05 PIC X(8) VALUE'X XX. 05 PIC X(8) VALUE'X XX". 05 PIC X(8) VALUE'X XXX. 05 PIC X(8) VALUE'X X 05 PIC X(8) VALUE 'X X X. 05 PIC X(8) VALUE'X XX". 05 PIC X(8) VALUE 'X X XX". 05 PIC X(8) VALUE'X XX 05 PIC X(8) VALUE'X XXX". 05 PIC X(8) VALUE 'X XXX'. 05 PIC X(8) VALUE'X XXXX- 05 PIC X(8) VALUE'XX 05 PIC X(8) VALUE'X X X. 40 05 PIC X(8) VALUE'X X X". 05 PIC X(8) VALUE' X X XX'. : 05 PIC X(8) VALUE' XX X ". 05 PIC X(8) VALUE'X X X X.. . 05 PIC X(8) VALUE'X X XX". 45 05 PIC X(8) VALUE' X X XXX". 05 PIC X(8) VALUE' X XX ". 05 PIC X(8) VALUE' X XX X.

N

05 PIC X(8) VALUE'X XXX. 05 PIC X(8) VALUE ' X XX XX. 05 PIC X(8) VALUE 'X XXX . 05 PIC X(8) VALUE 'X XXX X'. : 5 05 PIC X(8) VALUE ' X XXXX. 05 PIC X(8) VALUE ' X XXXXX'. 0S PIC X(8) VALUE 'XX 05 PIC X(8) VALUE 'XX X. 05 PIC X(8) VALUE'XX X". 05 PIC X(8) VALUE 'XX XX. 05 PIC X(8) VALUE 'XX X 05 PIC X(8) VALUE 'XX XX". 05 PIC X(8) VALUE 'XX XX" 05 PIC X(8) VALUE ' XX XXX. 05 PIC X(8) VALUE 'XX X 05 PIC X(8) VALUE 'XX X X. 05 PIC X(8) VALUE 'XX XX". 05 PIC X(8) VALUE ' XX X XX. 05 PIC X(8) VALUE ' XX XX . 05 PIC X(8) VALUE ' XX XX X.. 05 PIC X(8) VALUE ' XX XXX". 05 PIC X(8) VALUE ' XX XXXX. 05 PIC X(8) VALUE 'XXX 05 PIC X(8) VALUE ' XXX X. 05 PIC X(8) VALUE 'XXX X". 05 PIC X(8) VALUE ' XXX XX. 05 PIC X(8) VALUE 'XXX X ". 05 PIC X(8) VALUE ' XXX X X.. 05 PIC X(8) VALUE ' XXX XX. 05 PIC X(8) VALUE ' XXX XXX. 05 PIC X(8) VALUE ' XXXX 05 PIC X(8) VALUE ' XXXX X. 05 PIC X(8) VALUE ' XXXX X". 05 PIC X(8) VALUE ' XXXX XX. 05 PIC X(8) VALUE ' XXXXX 05 PIC X(8) VALUE ' XXXXX X.. 05 PIC X(8) VALUE ' XXXXXX . 05 PIC X(8) VALUE ' XXXXXXX'. 05 PIC X(8) VALUE 'X 40 05 PIC X(8) VALUE 'X X. : 05 PIC X(8) VALUE'X X" ‘ 05 PIC X(8) VALUE 'X XX. 05 PIC X(8) VALUE'X X 05 PIC X(8) VALUE 'X XX. 45 05 PIC X(8) VALUE 'X XX. 05 PIC X(8) VALUE 'X XXX. 05 PIC X(8) VALUE'X X

05 PIC X(8) VALUE'X X X-. 05 PIC X(8) VALUE'X XX" 05 PIC X(8) VALUE'X X XX". 05 PIC X(8) VALUE'X XX ". 05 PIC X(8) VALUE'X XXX 05 PIC X(8) VALUE'X XXX". 05 PIC X(8) VALUE 'X XXXX. 05 PIC X(8) VALUE'X X 05 PIC X(8) VALUE'X X X. 05 PIC X(8) VALUE'X X X". 05 PIC X(8) VALUE 'X X XX. 05 PIC X(8) VALUE'X XX 05 PIC X(8) VALUE 'X X X X'. 05 PIC X(8) VALUE 'X X XX. 05 PIC X(8) VALUE 'X X XXX. 05 PIC X(8) VALUE 'X XX 05 PIC X(8) VALUE 'X XX X. 05 PIC X(8) VALUE 'X XXX. 05 PIC X(8) VALUE 'X XX XX. 05 PIC X(8) VALUE 'X XXX '. 05 PIC X(8) VALUE 'X XXX X.. 05 PIC X(8) VALUE 'X XXXX'. 05 PIC X(8) VALUE 'X XXXXX.. 05 PIC X(8) VALUE'X X 05 PIC X(8) VALUE'X XX. 05 PIC X(8) VALUE'X X X'. 05 PIC X(8) VALUE'X X XX. 05 PIC X(8) VALUE 'X X X 05 PIC X(8) VALUE 'X X X X.. 05 PIC X18; VALUE 'X X XX 05 PIC X(8) VALUE 'X X XXX. 05 PIC X(8) VALUE'X X X ". 05 PIC X(8) VALUE 'X X X X. 05 PIC X(8) VALUE 'X X XX". 05 PIC X(8) VALUE 'X X X XX". 05 PIC X(8) VALUE 'X X XX ". 05 PIC X(8) VALUE 'X X XX X". 05 PIC X(8) VALUE "X X XXX. 05 PIC X(8) VALUE 'X X XXXX". 40 05 PIC X(8) VALUE 'X XX 05 PIC X(8) VALUE 'X XX X'. 05 PIC X(8) VALUE 'X XX X". 05 PIC X(8) VALUE 'X XX XX. 05 PIC X(8) VALUE 'X XX X ". 45 05 PIC X(8) VALUE 'X XX X X". 05 PIC X(8) VALUE 'X XX XX . 05 PIC X(8) VALUE 'X XX XXX".

05 PIC X(8) VALUE 'X XXX *. 05 PIC X(8) VALUE 'X XXX X.. 05 PIC X(8) VALUE 'X XXX X '. 05 PIC X(8) VALUE 'X XXX XX. : 5 05 PIC X(8) VALUE 'X XXXX '. 05 PIC X(8) VALUE 'X XXXX X". 05 PIC X(8) VALUE "X XXXXX '. 05 PIC X(8) VALUE 'X XXXXXX'. 05 PIC X(8) VALUE 'XX 05 PIC X(8) VALUE 'XX X'. 05 PIC X(8) VALUE 'XX X". 05 PIC X(8) VALUE 'XX XX. : 05 PIC X(8) VALUE 'XX X 05 PIC X(8) VALUE 'XX XX. 05 PIC X(8) VALUE 'XX XX. 05 PIC X(8) VALUE 'XX XXX'. 05 PIC X(8) VALUE 'XX X ". 05 PIC X(8) VALUE 'XX X X.. 05 PIC X(8) VALUE 'XX XX". 05 PIC X(8) VALUE 'XX X XX. 05 PIC X(8) VALUE 'XX XX ". 05 PIC X(8) VALUE "XX XX X.. 05 PIC X(8) VALUE 'XX XXX". 05 PIC X(8) VALUE 'XX XXXX'. 05 PIC X(8) VALUE 'XX X 05 PIC X(8) VALUE 'XX X X. 05 PIC X(8) VALUE 'XX X X". 05 PIC X(8) VALUE 'XX X XX. 05 PIC X(8) VALUE 'XX X X ". 05 PIC X(8) VALUE 'XX X X X". 05 PIC X(8) VALUE "XX X XX". 05 PIC X(8) VALUE 'XX X XXX'. 05 PIC X(8) VALUE 'XX XX ". 05 PIC X(8) VALUE 'XX XX X.. 05 PIC X(8) VALUE 'XX XX X ". 05 PIC X(8) VALUE "XX XX XX". 05 PIC X(8) VALUE 'XX XXX . 05 PIC X(8) VALUE "XX XXX X'. 05 PIC X(8) VALUE "XX XXXX ". 40 05 PIC X(8) VALUE "XX XXXXX'. 05 PIC X(8) VALUE "XXX 05 PIC X(8) VALUE 'XXX X.. 05 PIC X(8) VALUE "XXX X'. 05 PIC X(8) VALUE "XXX XX'. 45 05 PIC X(8) VALUE "XXX X ". 05 PIC X(8) VALUE 'XXX X X". 05 PIC X(8) VALUE "XXX XX.

05 PIC X(8) VALUE 'XXX XXX 05 PIC X(8) VALUE 'XXX X 05 PIC X(8) VALUE 'XXX X X' 05 PIC X(8) VALUE XXX XX". 05 PIC X(8) VALUE 'XXX X XX'. ‘ 05 PIC X(8) VALUE 'XXX XX ". 05 PIC X(8) VALUE 'XXX XX X'. 05 PIC X(8) VALUE XXX XXX". 05 PIC X(8) VALUE "XXX XXXX'. : 05 PIC X(8) VALUE 'XXXX 05 PIC X(8) VALUE 'XXXX X' 05 PIC X(8) VALUE 'XXXX X". 05 PIC X(8) VALUE 'XXXX XX 05 PIC X(8) VALUE XXXX X ". 05 PIC X(8) VALUE 'XXXX X X'. 05 PIC X(8) VALUE 'XXXX XX". 05 PIC X(8) VALUE 'XXXX XXX" 05 PIC X(8) VALUE XXXXX 05 PIC X(8) VALUE 'XXXXX X' 05 PIC X(8) VALUE 'XXXXX X". 05 PIC X(8) VALUE "XXXXX XX". 05 PIC X(8) VALUE 'XXXXXX ". 05 PIC X(8) VALUE 'XXXXXX X'. 05 PIC X(8) VALUE 'XXXXXXX ". 05 PIC X(8) VALUE "XXXXXXXX".

A 31000-EXPAND-THE-BIT-MAP. * The following describes the preferable steps by which the character map is generated. For each byte of the bit-map, move the byte to the right-most byte (16) of P-X, a two-byte field which is redefined as a half-word binary number, P. Then use

P as a subscript to find the parsing-pattern in table 18 which will contain a string of eight "X's and/or spaces equivalent to the eight bits. Move that pattern into SEL-ELEM-ENTRIES-ALL which is the "byte-map" 22.

MOVE IP66102-BIT-BYTE-1 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1) * ADD ONE BECAUSE A BIT PATTERN OF X'00' * MUST RETRIEVE PARSING-PATTERN (1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (1:8)

MOVE P66102-BIT-BYTE-2 TO 400-P-X ] MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (9:8)

MOVE IP66102-BIT-BYTE-3 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO 1P65504-SEL-ELEM-ENTRIES-ALL (17:8)

MOVE IP66102-BIT-BYTE-4 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (25:8)

MOVE IP66102-BIT-BYTE-5 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (33:8)

MOVE IP66102-BIT-BYTE-6 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO I1P65504-SEL-ELEM-ENTRIES-ALL (41:8)

MOVE IP66102-BIT-BYTE-7 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (49:8)

MOVE IP66102-BIT-BYTE-8 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (57:8)

MOVE IP66102-BIT-BYTE-9 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (65:8)

MOVE IP66102-BIT-BYTE-10 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO 1P65504-SEL-ELEM-ENTRIES-ALL (73:8)

MOVE IP66102-BIT-BYTE-11 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (81:8)

MOVE IP66102-BIT-BYTE-12 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO IP65504-SEL-ELEM-ENTRIES-ALL (89:8)

MOVE IP66102-BIT-BYTE-13 TO 400-P-X 40 MOVE 500-PARSING-PATTERN (400-P + 1)

TO 1P65504-SEL-ELEM-ENTRIES-ALL (97:8) : MOVE [P66102-BIT-BYTE-14 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO [P65504-SEL-ELEM-ENTRIES-ALL (105:8) 45 MOVE [P66102-BIT-BYTE-15 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO 1P65504-SEL-ELEM-ENTRIES-ALL (113:8)

MOVE IP66102-BIT-BYTE-16 TO 400-P-X

MOVE 500-PARSING-PATTERN (400-P + 1)

TO 1P65504-SEL-ELEM-ENTRIES-ALL (121:8)

This technique can preferably be used in the parsing of ISO 8583-1993

IPM financial transaction card originated messages, and can be incorporated into pre- edit and central site clearing systems. More generally it is useful in interpreting any - bit-mapped record or message when implementation constraints dictate the use of

COBOL.

The foregoing merely illustrates the principles of the invention. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the invention and thus within the spirit and scope of the invention.

Claims (4)

1. A method for extracting data from bit-map messages using COBOL statements, said messages having one of many possible bit-map combinations S representing messages having varying fields and lengths, comprising the steps of’ assigning a numeric value for each possible bit-map combination; generating a conversion table associating a byte-map for each of said values; identifying a bit-map within a particular message; converting said bit-map into an associated byte-map, said conversion step including generating a particular numeric value for said bit-map and associating said byte-map to said bit-map as a function of said conversion table; and determining, based on the resulting byte-map, the absence or presence of said data.

2. The method of claim 1 wherein said bit-map messages are transmitted in accordance with ISO 8583-1993.

3. The method of claim 2 wherein said determining step includes determining the presence or absence of a particular field in said particular message and, if present, the length of said field.

4. A method of extracting data from bit-map messages using COBOL statements, said messages having one of many possible bit-map combinations representing messages having varying fields and lengths, substantially as herein described and with reference to Figure 1. -15- AMENDED SHEET

, K . od

I. < = 04 ui fo : << I oO pad 72) LX 1 X| Lox x) Z borox oxi hh xox wd I I I Ix x x x| & a EE XX xX xo Loo 1X xX x xo $) RS TE I Xx x xX I IX xX xX XI g ° IE IX X X X| © ry o a Oo Lie ~N fry s) Sr hs ~ I PR PH oO oO oe Ee [eo oo a. |= ! ; i < | i | : HE dE f a / 9 ; So ° yd i A i ! — : 1/1 T