Method and system for generating a parser and parsing complex data

• US 8,903,717 B2
• Filed: 02/21/2014
• Issued: 12/02/2014
• Est. Priority Date: 03/15/2013
• Status: Active Grant

• Current Assignee: Palantir Technologies Incorporated
• Original Assignee: Palantir Technologies Incorporated
• Inventors: Elliot, Mark
• Primary Examiner(s): Godbold, Douglas
• Application Number:
  US14/187,164
• Publication Number:
  US 20140280255A1
• Time in Patent Office: 284 Days
• Field of Search: 704/1, 704/9, 704/10
• US Class Current: 704/9
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/90344 by using string matching techniques
• CPC Class Codes: G06F 40/205 Parsing
• CPC Class Codes: G06F 8/427 Parsing

Abstract

Computer-implemented systems and methods are disclosed for constructing a parser that parses complex data. In some embodiments, a method is provided for receiving a parser definition as an input to a parser generator and generating a parser at least in part from the parser definition. In some embodiments, the generated parser comprises two or more handlers forming a processing pipeline. In some embodiments, the parser receives as input a first string into the processing pipeline. In some embodiments, the parser generates a second string by a first handler and inputs the second string regeneratively into the parsing pipeline, if the first string matches an expression specified for the first handler in the parser definition.

Claims

1. A system for parsing complex data, the system comprising:

a memory device configured to store a set of instructions; and

at least one processor configured to execute the set of instructions to perform the following operations;

input one or more strings into a parsing pipeline within a parser, and

execute, for each inputted string into the parsing pipeline, the following operations;

generate a second string, by a first handler, based in part on a current input string to the parsing pipeline, if the current input string to the parsing pipeline matches a predetermined string of an expression specified for the first handler in a parser definition; and

input the second string, regeneratively, by the first handler, to the parsing pipeline, if the current input string to the parsing pipeline matches a predetermined string of an expression specified for the first handler in the parser definition.

2. The system of claim 1, wherein the at least one processor is further configured by the set of instructions to perform the following operation as part of the execution:

communicate, by the first handler, as an input string to a second handler, the input string to the parsing pipeline, if the current input string to the parsing pipeline does not match a predetermined string of an expression specified for the first handler in the parser definition.

3. The system of claim 2, wherein the at least one processor is further configured by the set of instructions to perform the following operations as part of the execution:

generate a third string, by a third handler, based in part on the input string to second handler, if the input string to second handler matches a predetermined string of an expression specified for the second handler in the parser definition; and

input the third string, by the second handler, as an input to another handler, if the input string to second handler matches a predetermined string of an expression specified for the second handler in the parser definition.

4. The system of claim 3, wherein the at least one processor is further configured by the set of instructions to perform the following operation as part of the execution:

generate an output string from a third handler, by the third handler, if the current input string to the parsing pipeline does not match predetermined strings of expressions specified for handlers other than the third handler in the parser definition.

5. A method for parsing complex data, the method comprising the following operations performed by one or more processors:

inputting one or more strings into a parsing pipeline within a parser; and

executing each inputted string into the parsing pipeline, the executing comprising;

generating a second string, by a first handler, based in part on the current input string to the parsing pipeline, if the current input string to the parsing pipeline matches a predetermined string of an expression specified for the first handler in a parser definition; and

inputting the second string, regeneratively, by the first handler, to the parsing pipeline, if the current input string to the parsing pipeline matches a predetermined string of an expression specified for the first handler in the parser definition.

6. The method of claim 5, wherein executing each inputted string further comprises:

communicating, by the first handler, as an input string to a second handler, the input string to the parsing pipeline, if the current input string to the parsing pipeline does not match a predetermined string of an expression specified for the first handler in the parser definition.

7. The method of claim 6, wherein executing each inputted string further comprises:

generating a third string, by a third handler, based in part on the input string to second handler, if the input string to second handler matches a predetermined string of an expression specified for the second handler in the parser definition; and

inputting the third string, by the second handler, as an input to another handler, if the input string to second handler matches a predetermined string of an expression specified for the second handler in the parser definition.

8. The method of claim 7, wherein executing each inputted string further comprises:

generating an output string from a third handler, by the third handler, if the current input string to the parsing pipeline does not match predetermined strings of expressions specified for handlers other than the third handler in the parser definition.

9. The method of claim 8, wherein executing each inputted string further comprises:

generating an output string from the parsing pipeline based at least in part on an output string generated by a last handler in the parsing pipeline.

10. A non-transitory computer readable medium that stores a set of instructions that are executable by at least one processor of an electronic device to cause the electronic device to perform a method for parsing complex data, the method comprising:

inputting one or more strings into a parsing pipeline within a parser; and

executing the one or more inputted string into the parsing pipeline, wherein the set of instructions for the executing further comprises instructions executable by the electronic device to cause the electronic device to;

generate a second string, by a first handler, based in part on the current input string to the parsing pipeline, if the current input string to the parsing pipeline matches a predetermined string of an expression specified for the first handler in a parser definition; and

input the second string, regeneratively, by the first handler, to the parsing pipeline, if the current input string to the parsing pipeline matches a predetermined string of an expression specified for the first handler in the parser definition.

11. The non-transitory computer readable medium of claim 10, wherein the set of instructions for the executing further comprises instructions executable by the electronic device to cause the electronic device to:

communicate, by the first handler, as an input string to a second handler, the input string to the parsing pipeline, if the current input string to the parsing pipeline does not match a predetermined string of an expression specified for the first handler in the parser definition.

12. The non-transitory computer readable medium of claim 11, wherein the set of instructions for the executing further comprises instructions executable by the electronic device to cause the electronic device to:

generate a third string, by a third handler, based in part on the input string to second handler, if the input string to second handler matches a predetermined string of an expression specified for the second handler in the parser definition; and

input the third string, by the second handler, as an input to another handler, if the input string to second handler matches a predetermined string of an expression specified for the second handler in the parser definition.

13. The non-transitory computer readable medium of claim 12, wherein the set of instructions for the executing further comprises instructions executable by the electronic device to cause the electronic device to:

generate an output string from a third handler, by the third handler, if the current input string to the parsing pipeline does not match predetermined strings of expressions specified for handlers other than the third handler in the parser definition.

14. The non-transitory computer readable medium of claim 13, wherein the set of instructions for the executing further comprises instructions executable by the electronic device to cause the electronic device to:

generate an output string from the parsing pipeline based at least in part on an output string generated by a last handler in the parsing pipeline.