System for automatic generation of message parser

Claim 1

A system for automatically generating computer program code for use in parsing messages having a known speci­fication of allowable formats and key words, the system including - a lexical analyzer generator (105) conventionally used with key words of a predetermined computer programming language for generating a lexical analyzer program source code (104) in the pre­determined language, - a first object code converter for use with the predetermined language, - a syntax analyzer source code generator conveniently used for generating a conversion program expressed in the predetermined language, and - a second object code converter for use with the predetermined language, characterized by: - key word examining means (103) for passing a list of the key words (102) along with the action to be taken when each key word is recognized to the lexical analyzer generator (105); - the first object code converter operative to receive the source code (104) from the lexical analyzer generator (105) and to generate an object code implementation (106) of a lexical analyzer (103) for use in analyzing the messages to be parsed; - production means (103) for generating a set of generation rule productions (107) defining allowable formats of the messages to be parsed in accordance with the known specifications; - the syntax analyzer source code generator operative to receive the set of productions (107) and to generate a syntax analyzer program source code (108) expressed in the predetermined language; and - the second object code converter operative to receive the syntax analyzer program source code (108) and to generate (110) an object code implemen­tation of a syntax analyzer (105) for use in analyzing the messages to be parsed.

Claim 2

A system for automatically generating computer program code for use in parsing messages having a known speci­fication of allowable formats and key words, the system including - a lexical analyzer generator (105) conventionally used with key words of a predetermined computer programming language for generating a lexical analyzer program source code (104) in the pre­determined language, - a first object code converter for use with the predetermined language, - a syntax analyzer source code generator conveniently used for generating a conversion program expressed in the predetermined language, and - a second object code converter for use with the predetermined language, characterized by: - key word examining means (103) for passing a list of the key words (102) along with the action to be taken when each key word is recognized to the lexical analyzer generator (105); - the first object code converter operative to receive the source code (104) from the lexical analyzer generator (105) and to generate an object code implementation (106) of a lexical analyzer (103) for use in analyzing the messages to be parsed; - production means (103) for generating a set of generation rule productions (107) defining allowable formats of the messages to be parsed in accordance with the known specifications; - the syntax analyzer source code generator operative to receive the set of productions (107) and to generate a syntax analyzer program source code (108) expressed in the predetermined language; and - the second object code converter operative to receive the syntax analyzer program source code (108) and to generate (110) an object code implemen­tation of a syntax analyzer (105) for use in analyzing the messages to be parsed.

Claim 5

A system for automatically generating computer program code for use in parsing messages having a know speci­fication of allowable formats and key words, including - a lexical analyzer generator (105) for generating a lexical analyzer program source code (104) in a predetermined high-level computer code language, characterized by: - key word examining means (103) for passing a list of the key words (102) along with the action to be taken when each key work is recognized to the lexical analyzer generator (105); - first compiler means (109) for receiving the source code (104) from the lexical analyzer generator (105) and for generating an object code implemen­tation (106) of a lexical analyzer (103) for use in analyzing the messages to be parsed; - production means (103) for generating a set of generation rule productions (107) defining allowable formats of the messages to be parsed in accordance with the known specification; - compiler generator means (111) for receiving the set of productions (107) and for generating a syntax analyzer program source code (108) in the predetermined computer code language; and - second compiler means (109) for receiving the syntax analyzer program source code (104) and generating an object code implementation (106) of a syntax analyzer (203) for use in analyzing the messages to be parsed.

Claim 6

A system for automatically generating computer program code for use in parsing messages having a know speci­fication of allowable formats and key words, including - a lexical analyzer generator (105) for generating a lexical analyzer program source code (104) in a predetermined high-level computer code language, characterized by: - key word examining means (103) for passing a list of the key words (102) along with the action to be taken when each key work is recognized to the lexical analyzer generator (105); - first compiler means (109) for receiving the source code (104) from the lexical analyzer generator (105) and for generating an object code implemen­tation (106) of a lexical analyzer (103) for use in analyzing the messages to be parsed; - production means (103) for generating a set of generation rule productions (107) defining allowable formats of the messages to be parsed in accordance with the known specification; - compiler generator means (111) for receiving the set of productions (107) and for generating a syntax analyzer program source code (108) in the predetermined computer code language; and - second compiler means (109) for receiving the syntax analyzer program source code (104) and generating an object code implementation (106) of a syntax analyzer (203) for use in analyzing the messages to be parsed.

Claim 7

The system of any of claims 1 through 4, characterized by: - journal file means (201) containing messages to be parsed and operative to pass (202) message characters as input to the object code implemen­tation of the lexical analyzer (230); the lexical analyzer (203) operative to generate message tokens (204) and to pass the tokens to the object code implementation of a syntax analyzer (205) for generation of a parsed message (206, 208).

Claim 8

The system of any of claims 1 through 5, characterized in that the predetermined computer language is C.

Claim 9

The system of any of claims 1 through 6, characterized in that the lexical analyzer generator (105) comprises LEX.

Claim 10

The system of any of claims 1 through 7, characterized in that the generation rule productions (106) are expressed in Backus-Naur form (BNF).

Claim 11

The system of any of claims 3 through 8, characterized in that the compiler generator (111) comprises YACC.