Submatch Extraction
AssigneeHewlett Packard Enterprises Development LP
InventorsPratyusa Kumar Manadhata, Stuart Haber, Miranda Jane Felicity Mowbray, Prasad V. Rao, William G. Horne
Life of this patent
Estimating the term…
Abstract
A method for submatch extraction may include receiving an input string, receiving a regular expression, and converting the regular expression with capturing groups into a plurality of finite automata to extract submatches. The method further includes using a first automaton to determine whether the input string is in a language described by the regular expression, and to process the input string, and using states of the first automaton in a second automaton to extract the submatches.
Claims12
A method for submatch extraction, the method comprising:
- receiving an input string;
- receiving a regular expression;
- and
- converting, by a processor, the regular expression with capturing groups into a plurality of finite automata to extract submatches, wherein the extracting includes:
- using a first automaton to determine whether the input string is in a language described by the regular expression, and to process the input string;
- and
- using states of the first automaton in a second automaton to extract the submatches.
A submatch extraction system comprising:
- a memory storing a module comprising machine readable instructions to:
- receive an input string;
- receive a regular expression;
- and
- convert the regular expression into a plurality of finite automata to extract submatches, wherein the extracting includes:
- using a first automaton to determine whether the input string is in a language described by the regular expression, and to process the input string;
- and
- using states of the first automaton in a second automaton to extract the submatches;
- and
- a processor to implement the module.
A non-transitory computer readable medium having stored thereon machine readable instructions for submatch extraction, the machine readable instructions when executed cause a computer system to:
- receive an input string;
- receive a regular expression;
- and
- convert, by a processor, the regular expression into a plurality of finite automata to extract submatches, wherein the extracting includes:
- using a first automaton to determine whether the input string is in a language described by the regular expression, and to process the input string;
- and
- using states of the first automaton in a second automaton to extract the submatches.
Dependencies are inferred from the claim text.