NFA implementation with support for kleene*, union and simple concatination using thomposon's construction with simulation function that matches a given regex

1 files changed, 2 insertions, 7 deletions

diff --git a/src/main.rs b/src/main.rs
index bcc0f01..6b4612d 100755
--- a/src/main.rs
+++ b/src/main.rs
@@ -5,17 +5,12 @@ use regex::*;
 
 fn test(regex: &str, input: &str) -> bool {
     let token = Regex::new(String::from(regex));
-    dbg!(&token);
     let mut nfa = NFA::new();
     nfa.regex_to_nfa(token);
-    let mut x: Vec<(&usize, &State)> = nfa.states.iter().map(|(k, v)| (k, v)).collect();
-    x.sort();
-    dbg!(x);
-    // nfa.match_re(String::from(input))
-    true
+    nfa.matches(String::from(input))
 }
 
 fn main() {
     // println!("{}", test("a.b..", "a.bxb"));
-    println!("{}", test(".*b", "aaaaaabbb"))
+    println!("{}", test(".b", "ab"))
 }