Gregex

Gregex is a regular expression solver which utilizes Non-deterministic Finite Automata (NFA) to simulate the input strings.

Usage

use::gregex::regex;

fn main() {
    let regex = regex("(a.b)*");
    assert!(regex.simulate("abab"));
}

Theory

The project uses Glushkov's construction algorithm for creating the NFA.

The pipeline can be summarised as below