Regular Expression Refactoring for Zero-Length Assertions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing regular expression evaluation engines struggle with zero-length assertions, requiring multiple scans of input data and inefficient use of computing resources due to their nature of evaluating characters before or after the assertion without consuming them.
Innovation Solution
A system that compiles regular expressions with zero-length assertions into equivalent sets without assertions, using Boolean logic to combine results, allowing parallel processing and a single data stream scan.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If regular expressions with zero-length assertions are processed using traditional evaluation systems, then the expressions can be evaluated, but multiple scans of the input data are required leading to increased computational resources and slower processing times
Solution Approach 1:
The patent segments the regular expression with zero-length assertions into multiple equivalent regular expressions without zero-length assertions. Each segmented expression can be evaluated independently in a single pass through the input data, eliminating the need for multiple scans and reducing computational resource usage.
Solution Approach 2:
The patent performs preliminary transformation of the regular expression with zero-length assertions into equivalent expressions without such assertions before the actual evaluation process. This preliminary action converts the complex evaluation problem into simpler sub-problems that can be solved more efficiently in a single pass.
2Loss of time
If regular expressions with zero-length assertions are processed using traditional evaluation systems, then the expressions can be evaluated, but multiple scans of the input data are required leading to increased processing time
Solution Approach 1:
By segmenting the original regular expression into multiple equivalent expressions that can be evaluated simultaneously in a single pass, the patent eliminates the sequential multiple-scan approach, thereby reducing processing time and improving overall processing efficiency.
Solution Approach 2:
The patent merges the results of multiple equivalent regular expression evaluations into a final result that satisfies the original regular expression with zero-length assertions. This combining approach allows parallel evaluation of multiple expressions while maintaining the correctness of the original pattern matching.
3Extent of automation
If regular expressions with zero-length assertions are transformed into equivalent sets without such assertions, then parallel evaluation is enabled, but additional transformation steps are required
Solution Approach 1:
The transformation of regular expressions with zero-length assertions into equivalent expressions without such assertions is performed as a preliminary step before parallel evaluation. This automation of the transformation process enables subsequent parallel evaluation while managing complexity through systematic conversion rules.
Solution Approach 2:
The patent creates multiple copies of the input data or evaluation context that can be processed in parallel by different equivalent regular expressions. This copying approach enables parallel evaluation without requiring complex inter-process communication or coordination during the evaluation phase.
Data Source
AI summary
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.