Back to results
US 2026/0227975 A1Published application
Regular expression processor
AssigneeNVIDIA Corporation
InventorsJohn Hurley, Xiaolin Cao, Rafiullah Khan
Life of this patent
Estimating the term…
Abstract
Apparatuses, systems, and techniques to process regular expressions. In at least one embodiment, a regular expression that includes at least one zero-length assert is refactored and processed as an equivalent plurality of regular expressions that do not contain zero-length asserts.
Claims20
A non-transitory machine-readable medium having stored thereon a set of instructions, which if performed by one or more processors, cause the one or more processors to at least:
- obtain source code describing a first regular expression with a zero-length assert;
- determine a plurality of second regular expressions without the zero-length assert that, when evaluated, generate a result equivalent to the first regular expression with the zero-length assert;
- modify the source code to replace instructions corresponding to the first regular expression with instructions corresponding to the plurality of second regular expressions without the zero-length assert;
- and
- compile the modified source code without the first regular expression with the zero-length assert.
2 more elements
A computer-implemented method comprising:
- obtaining source code describing a first regular expression with a zero-length assert;
- determining a plurality of second regular expressions without the zero-length assert that, when evaluated, generate a result equivalent to the first regular expression with the zero-length assert;
- modifying the source code to replace instructions corresponding to the first regular expression with instructions corresponding to the plurality of second regular expressions without the zero-length assert;
- and
- compiling the modified source code without the first regular expression with the zero-length assert.
2 more elements
A system comprising:
- one or more processors;
- and
- a memory comprising instructions that, when executed by the one or more processors, cause the system to:
- obtain source code describing a first regular expression with a zero-length assert;
- determine a plurality of second regular expressions without the zero-length assert that, when evaluated, generate a result equivalent to the first regular expression with the zero-length assert;
- modify the source code to replace instructions corresponding to the first regular expression with instructions corresponding to the plurality of second regular expressions without the zero-length assert;
- and
- compile the modified source code without the first regular expression with the zero-length assert.
5 more elements
Dependencies are inferred from the claim text.