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.
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. 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.