GRAPH OPTIMIZED MESSAGE MODEL PARSER

• US 20180203695A1
• Filed: 01/13/2017
• Published: 07/19/2018
• Est. Priority Date: 01/13/2017
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Geleji, Geza, Ross, Martin A.
• Granted Patent: US 10,592,313 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 8/20 Software design
• CPC Class Codes: G06F 8/427 Parsing
• CPC Class Codes: G06F 9/30058 Conditional branch instructions
• CPC Class Codes: G06F 9/3867 using instruction pipelines
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

This invention relates to a system, method and computer program product for parsing a message against a message model, the message mode comprising hierarchical message element options organized into nodes and branches. The method includes: setting, by a computer device, a current node and current branch to a first node and first branch in the message model; setting, by the computer device, a return marker in the message at a point corresponding to the current node; parsing, by the computer device, the message from the return marker against the current branch of the message model; setting, by the computer device, the current branch to a further branch based on the current message model branch being not successfully parsed against the message; and parsing, by the computer device, the message again from the return marker whereby the parsing does not need to start from the beginning of the message model.

Claims

1. A system for parsing a message against a message model, the message model comprising hierarchical message element options organized into nodes and branches, the system comprising:

a processor, a computer readable memory, and a computer readable storage medium associated with a computer device;

program instructions of an initializer configured to set a current node and current branch to a first node and first branch in the message model;

program instructions of a return marker configured to set a return mark in the message at a point corresponding to the current node;

program instructions of a branch parser configured to parse the message from the return mark against the current branch of the message model; and

program instructions of a graph changer configured to set the current branch to a further branch based on the current message model branch being not successfully parsed against the message;

wherein the program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory; and

the branch parser is configured to parse the message again from the return mark so that parsing does not need to start from the beginning of the message model.

2. The system according to claim 1 wherein the graph changer is further configured to set a new node in the message model as the current node and set a new return marker based on the current message model branch being successfully parsed against the message.

3. The system according to claim 1 wherein the graph changer is further configured to set the current branch to a further branch on a previous node based on there being no further branch on the current node.

4. A computer-implemented method for parsing a message against a message model, the message model comprising hierarchical message element options organized into nodes and branches, the method comprising:

setting, by a computer device, a current node and current branch to a first node and first branch in the message model;

setting, by the computer device, a return marker in the message at a point corresponding to the current node;

parsing, by the computer device, the message from the return marker against the current branch of the message model;

setting, by the computer device, the current branch to a further branch based on the current message model branch being not successfully parsed against the message; and

parsing, by the computer device, the message again from the return marker whereby the parsing does not need to start from the beginning of the message model.

5. The method according to claim 4 further comprising setting a new node in the message model as the current node and setting a new return marker based on the current message model branch being successfully parsed against the message.

6. The method according to claim 4 further comprising setting the current branch to a further branch on a previous node based on there being no further branch on the current node.

7. A computer program product for parsing a message against a message model, the message model comprising hierarchical message element options organized into nodes and branches, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:

set a current node and current branch to a first node and first branch in the message model;

set a return marker in the message at a point corresponding to the current node;

parse the message from the return marker against the current branch of the message model;

set the current branch to a further branch based on the current message model branch being not successfully parsed against the message; and

parse the message again from the return marker whereby the parsing does not need to start from the beginning of the message model.