Building target dfa graphs utilizing predicates with integer and/or floating-point conditions

A computing device, comprising:

• a regular expression (regex) hardware accelerator including
• a deterministic finite automaton (DFA) engine configured to execute an object file, and
• a cache coupled to the DFA engine, the cache configured to load at least a portion of the object file;
• and
• a compiler executable to generate the object file based at least upon a target DFA graph by
• receiving a predicate including one or more of an integer condition or a floating-point condition,
• transforming the predicate to form a rewritten predicate with an equivalent expression, and
• building the target DFA graph based at least upon the rewritten predicate.

A method on a computing device including a deterministic finite automaton (DFA) engine configured to execute an object file, the method comprising:

• receiving a predicate including one or more of an integer condition or a floating-point condition;
• transforming the predicate to form a rewritten predicate with an equivalent expression;
• building a target DFA graph based at least upon the rewritten predicate;
• and
• generating the object file based at least upon the target DFA graph.