Splitting regular expressions between non-deterministic finite automaton and deterministic finite automaton

A computer-implemented method comprising:

• generating an abstract syntax tree by parsing a set of regular expression patterns;
• processing the abstract syntax tree to determine whether any of the set of regular expression patterns meets a specified criteria including:
• (1) whether a regular expression pattern is a single path regular expression, and (2) whether the regular expression pattern excludes assertions;
• using a first splitting process, splitting any of the set of regular expression patterns that meet the specified criteria into a first set of tokens;
• and
• using a second splitting process, different from the first splitting process, splitting any of the set of regular expression patterns that fail to meet the specified criteria into a second set of tokens, wherein the first splitting process outputs a first deterministic finite automaton (DFA) part of an abstract syntax tree (AST) and a first non-deterministic finite automaton (NFA) part of the AST, and wherein the second splitting process outputs a second DFA part of the AST and a second NFA part of the AST.

A non-transitory computer-readable medium comprising code corresponding to a method, the method comprising:

• parsing a set of regular expression patterns to generate an output;
• processing the output to determine whether any of the set of regular expression patterns meets a specified criteria including whether a regular expression pattern is a single path regular expression;
• using a first splitting process, splitting any of the set of regular expression patterns that meet the specified criteria into a first set of tokens;
• and
• using a second splitting process, different from the first splitting process, splitting any of the set of regular expression patterns that fail to meet the specified criteria into a second set of tokens, wherein the first splitting process outputs a first deterministic finite automaton (DFA) part of an abstract syntax tree (AST) and a first non-deterministic finite automaton (NFA) part of the AST, and wherein the second splitting process outputs a second DFA part of the AST and a second NFA part of the AST.