×

Parsing, evaluating leaf, and branch nodes, and navigating the nodes based on the evaluation

  • US 7,818,666 B2
  • Filed: 01/27/2006
  • Issued: 10/19/2010
  • Est. Priority Date: 01/27/2005
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method for processing electronic data having a first format, comprising:

  • defining a data parser description describing the first format, the data parser description including a plurality of leaf nodes and a plurality of branch nodes arranged in a tree structure, the leaf nodes each having an associated function, each of the branch nodes having one or more associated child nodes selected from leaf nodes and other branch nodes;

    receiving input data having the first format;

    processing the input data according to the data parser description, the processing including evaluating the nodes of the data parser description in an order defined by the tree structure, the evaluating including;

    if the node is a branch node, evaluating one or more of the associated child nodes;

    if the node is a branch node, determining whether the node evaluates successfully based on a result of the evaluating one or more of the child nodes;

    if the node is a leaf node, executing the associated function based on data in a current location in the input data;

    if the node is a leaf node, determining whether the node evaluates successfully based on a result of the executing; and

    after evaluating a given node, determining a next node to evaluate based on whether the given node has evaluated successfully; and

    generating output data based on the processing.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×