Jabba language

• US 9,311,058 B2
• Filed: 03/15/2013
• Issued: 04/12/2016
• Est. Priority Date: 03/15/2013
• Status: Active Grant

• Current Assignee: R2 Solutions LLC (Acacia Research Corporation)
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: Coalson, Josh
• Primary Examiner(s): BODDEN, EVRAL E
• Application Number:
  US13/842,826
• Publication Number:
  US 20140282393A1
• Time in Patent Office: 1,124 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 8/31 Programming languages or programming paradigms

Abstract

Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more computing devices to facilitate or otherwise support one or more processes or operations for Jabba language.

Claims

1. A method comprising:

generating one or more digital signals representative of a rule in a Jabba language construct descriptive of one or more named terms corresponding to at least one of the following;

a match expression;

a sequence;

an alternation;

a call;

or any combination thereof;

electronically incorporating said one or more named terms into a language external to a compiler to enable at least one matching operation with respect to one or more sequences of candidate atoms based, at least in part, on said one or more named terms; and

storing said one or more named terms incorporated into said language in a non-transitory memory.

2. The method of claim 1, and further comprising specifying at least one action via said one or more named terms represented via said one or more digital signals.

3. The method of claim 2, wherein said at least one action is specified by defining a form of said one or more sequences of said candidate atoms.

4. The method of claim 3, wherein said form comprises a natural language form.

5. The method of claim 2, wherein said at least one action is capable of generating one or more slots descriptive of said one or more sequences of candidate atoms based, at least in part, on said at least one matching operation.

6. The method of claim 1, wherein at least one of said one or more sequences of said candidate atoms comprises said one or more candidate atoms.

7. The method of claim 1, wherein said one or more candidate atoms comprises a data structure representing at least one of the following:

a fragment of text;

a class;

a set of key-value attributes;

or any combination thereof.

8. The method of claim 1, wherein said one or more candidate atoms comprises one or more non-contiguous candidate atoms.

9. The method of claim 1, wherein said rule is capable of creating at least one domain object representative of said rule.

10. The method of claim 1, wherein said at least one matching operation comprises at least one of the following:

an unordered sequence matching operation;

a reversible sequence matching operation;

or any combination thereof.

11. The method of claim 1, wherein said at least one matching operation is enabled with respect to one or more portions of said one or more candidate atoms.

12. The method of claim 1, wherein said one or more candidate atoms are associated with a search query.

13. The method of claim 1, wherein said non-transitory memory is associated with a library.

14. The method of claim 13, wherein said library comprises at least one of the following:

a pattern-matching library;

a run-time library;

or any combination thereof.

15. The method of claim 1, wherein said language is compatible with one or more rule interpretation engines associated with a compiler.

16. The method of claim 1, wherein said electronically incorporating said one or more named terms into said language external to said compiler further comprises generating at least one data structure capable of minimizing at least one computation operation via backtracking based, at least in part, on a partially-ordered set of said candidate atoms that concisely represents said one or more sequences of said candidate atoms.

17. An apparatus comprising:

a computing platform comprising at least one processor configured to;

generate one or more digital signals representative of a rule in a Jabba language construct descriptive of one or more named terms that shall correspond to at least one of the following;

a match expression;

a sequence;

an alternation;

a call;

or any combination thereof;

electronically incorporate said one or more named terms into a language external to a compiler to enable at least one matching operation with respect to one or more sequences of candidate atoms via said one or more named terms; and

store said one or more named terms as part of said language in a non-transitory memory.

18. The apparatus of claim 17, wherein said at least one processor further to specify at least one action via said one or more named terms.

19. The apparatus of claim 17, wherein said one or more candidate atoms comprises a data structure that shall be represented via at least one of the following:

a fragment of text;

a class;

a set of key-value attributes;

or any combination thereof.

20. An article comprising:

a non-transitory storage medium having instructions stored thereon executable by a special purpose computing platform to;

generate one or more digital signals representative of a rule in a Jabba language construct descriptive of one or more named terms that shall correspond to at least one of the following;

a match expression;

a sequence;

an alternation;

a call;

or any combination thereof; and

electronically incorporate said one or more named terms into a language external to a compiler to enable at least one matching operation with respect to one or more sequences of candidate atoms via said one or more named terms.

21. The article of claim 20, wherein said non-transitory storage medium further includes instructions to specify at least one action via said one or more named terms.