Search Results for "regular nfa"

RE2/J is a high-performance regular expression engine implemented in pure Java as a port of Google’s C++ RE2 library. Unlike traditional regex engines such as Java’s java.util.regex, PCRE, or Perl’s implementation—which rely on backtracking and can suffer from catastrophic exponential runtimes—RE2/J guarantees linear-time matching relative to input size. It achieves this efficiency by simulating all possible matches in a single pass using a nondeterministic finite automaton (NFA), ensuring predictable and safe performance even with complex patterns. ...

This program compiles regular expressions (regexes) written in the modified ECMAScript regex grammar into modular nondeterministic finite automata suitable for hardware acceleration. This was originally an extended re-implementation of the "front-end" part in the following paper: https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for...

This API provides an easy way of dealing with regular expressions. It provides DFA and NFA implementations, so if you need performance or group captures and analysis, both solutions are available.

Tautomaton is a C++11 -template library for deterministic (DFA) and non-deterministic finite automata (NFA). It supports regular expressions and efficient input matching of multiple regexps simultaneously. The library comes with a somewhat grep-like command-line tool for showcasing these features.

cmptNFA is a tool for automatic construction of compact non-deterministic finite automates from simple regular expression specification.We implemented tool using GNU Bison and Flex .

This program allows you to specify a Deterministic Finite Automata, Nondeterministic Finite Automata, or Generalized NFA and will return a regular expression which recognizes the same language as the FA you described.

Non backtacking NFA implementation of regular expressions for dot net.

This project is a fork of RE2, hosted at http://code.google.com/p/re2/. Why a fork? The reason for the fork is to address a need for use cases which conflict with one of RE2's central missions, which is to be lightweight. DFAlib's API's will change to reflect the needs of use cases which require features that have been rejected at RE2. DFAlib retains the New BSD license of RE2 and credit the original authors of RE2 as forming the basis of this new project. The central innovation DFAlib...