×

Graph optimized message model parser

  • US 10,592,313 B2
  • Filed: 01/13/2017
  • Issued: 03/17/2020
  • Est. Priority Date: 01/13/2017
  • Status: Active Grant
First Claim
Patent Images

1. A system for parsing a message against a message model, the system comprising:

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

    a first set of program instructions configured to;

    load a graph optimized message model, the graph optimized message model comprising;

    a hierarchical arrangement of a plurality of nodes and a plurality of branches, each branch of the plurality of branches connecting two nodes of plurality of nodes,wherein a first portion of the plurality of branches are common message elements, andwherein a second portion of the plurality of branches are different message element options;

    set a current node to a first node within the plurality of nodes of the graph optimized message model, the first node connected to one of the first portion of plurality of branches, and the first node connected to at least two of the second portion of the plurality of branches; and

    set a current branch to a first branch of second portion of the plurality of branches, the first branch connecting the first node to a second node of the plurality of nodes of the graph optimized message model;

    a second set of program instructions configured to set a return mark in the graph optimized message model at a point corresponding to the current node;

    a third set of program instructions configured to parse a message from the return mark against the current branch of the graph optimized message model;

    a fourth set of program instructions configured to set the current branch to a second branch of the second portion of the plurality of branches when the message did not successfully parse, the second branch being different than the first branch, the second branch connecting the first node to a new node of the plurality of nodes different than the second node, the new node being at a same level in the hierarchal arrangement as the second node; and

    a fifth set of program instructions configured to direct the third set of program instructions to parse the message again from the return mark,wherein the program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory; and

    the fourth set of program instructions and the fifth set of program instructions are configured to parse the message again at a point of an unsuccessful parse using a different message element option so that parsing does not need to start from the beginning of the message model.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×