Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
-
Updated
Feb 16, 2024 - Java
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
dregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.
1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings
Deterministic Regular Expressions with Backreferences
A Lightweight Java business rule expression language.
retree is regular-expression-tree, which supports quickly and concurrently matching of lots of regex patterns.
Regular Expressions and Lexing with DFAs
An implementation of Rob Pike's Virtual Machine-based regular expression engine
The application is developed in Java, converts any given Regular Expression to Minimised DFA. It follows the path: RE-->NFA-->DFA-->Minimised DFA.
A Regular Expression Engine ported from Microsoft's .Net Core Libraries for Java platform
Common regular expression patterns.
Add a description, image, and links to the regular-expression-engine topic page so that developers can more easily learn about it.
To associate your repository with the regular-expression-engine topic, visit your repo's landing page and select "manage topics."