31. A computer system for compiling a pattern into a non-deterministic finite automata (NFA) graph, the system comprising: a memory; and a processor, the processor coupled to the memory and configured to examine the pattern for a plurality of elements and a plurality of node types, each node type corresponding with an element, each element of the pattern to be matched at least zero times, the element representing a character, character class or string; and wherein the processor is further configured to generate a plurality of nodes of the NFA graph, each node of the plurality of nodes configured to match with one of the plurality of elements and store the node type corresponding to the element, a next node address in the NFA graph, a count value, and the element, wherein the next node address and the count value are applicable as a function of the node type stored and wherein the plurality of nodes generated enable a graph walk engine to identify the pattern in a payload with less nodes relative to another NFA graph representing the pattern and employed by the graph walk engine to identify the pattern in the payload.
35. The system of claim 31 , wherein the processor is further configured to match the pattern for at least one of an indication of a variable count node type, fixed count node type, fixed-variable count node type, character node type, case insensitive character node type, character class node type, string node type, case insensitive string node type, marked node type, and split node type.