laps_regex 0.1.1

Tools for generating NFAs, DFAs and state-transition tables from regular expressions.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
//! User interfaces for building and matching regular expressions.
//!
//! This module contains the regular expression builder [`RegexBuilder`]
//! and the regular expression matcher [`RegexMatcher`].

use crate::dfa::DFA;
use crate::mir::{Error as MirError, Mir, MirBuilder, SymbolOp};
use crate::nfa::NFA;
use crate::table::StateTransTable;
use regex_syntax::hir::Hir;
use regex_syntax::{parse, Error as RegexError, ParserBuilder};
use std::fmt;
use std::hash::Hash;

/// A builder for regular expressions with tag type `T`.
pub struct RegexBuilder<T> {
  re_tags: Vec<(String, T)>,
  enable_par: Option<bool>,
}

impl<T> RegexBuilder<T> {
  /// Creates a new regular expression builder.
  pub fn new() -> Self {
    Self {
      re_tags: Vec::new(),
      enable_par: None,
    }
  }

  /// Adds a new regular expression to the builder, with the given tag.
  pub fn add(mut self, re: &str, tag: T) -> Self {
    self.re_tags.push((re.into(), tag));
    self
  }

  /// Sets to [`Some(true)`] to construct the DFA in parallel,
  /// [`Some(false)`] to disable parallelization, and [`None`] to
  /// choose automatically.
  ///
  /// Defaults to [`None`].
  pub fn enable_par(mut self, enable_par: Option<bool>) -> Self {
    self.enable_par = enable_par;
    self
  }
}

impl<T> RegexBuilder<T>
where
  T: Clone + Hash + Eq + Ord,
{
  /// Builds all regular expressions in the current builder as UTF-8 mode.
  ///
  /// Returns a [`RegexMatcher`], or an error.
  pub fn build<S>(self) -> Result<RegexMatcher<S, T>, Error<T>>
  where
    S: Hash + Eq + Clone + Ord + SymbolOp + Sync + Send,
    Mir<S, T>: MirBuilder,
  {
    self.build_impl(parse)
  }

  /// Builds all regular expressions in the current builder as bytes mode.
  ///
  /// Returns a [`RegexMatcher`], or an error.
  pub fn build_bytes<S>(self) -> Result<RegexMatcher<S, T>, Error<T>>
  where
    S: Hash + Eq + Clone + Ord + SymbolOp + Sync + Send,
    Mir<S, T>: MirBuilder,
  {
    self.build_impl(|re| ParserBuilder::new().utf8(false).build().parse(re))
  }

  /// Implementation of all building methods.
  fn build_impl<R, S>(self, re_parse: R) -> Result<RegexMatcher<S, T>, Error<T>>
  where
    R: Fn(&str) -> Result<Hir, RegexError>,
    S: Hash + Eq + Clone + Ord + SymbolOp + Sync + Send,
    Mir<S, T>: MirBuilder,
  {
    if self.re_tags.is_empty() {
      Err(Error::EmptyBuilder)
    } else {
      Mir::Alter(
        self
          .re_tags
          .into_iter()
          .map(|(re, tag)| {
            re_parse(&re)
              .map_err(|e| Error::Regex(Box::new(e), tag.clone()))
              .and_then(|hir| Mir::new(hir).map_err(Error::Mir))
              .map(|mir| (mir, Some(tag)))
          })
          .collect::<Result<_, _>>()?,
      )
      .optimize()
      .map(|mir| {
        RegexMatcher::new(StateTransTable::new(DFA::new(
          NFA::new(mir),
          self.enable_par,
        )))
      })
      .map_err(Error::Mir)
    }
  }
}

impl<T> Default for RegexBuilder<T> {
  fn default() -> Self {
    Self::new()
  }
}

/// Possible errors in building of regular expressions with tag type `T`.
#[derive(Debug)]
pub enum Error<T> {
  /// There is no regular expressions in [`RegexBuilder`].
  EmptyBuilder,
  /// An error occurred during parsing the regular expression with the tag `T`.
  Regex(Box<RegexError>, T),
  /// An error occurred during compiling or optimizing regular expressions.
  Mir(MirError),
}

impl<T> fmt::Display for Error<T> {
  fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
    match self {
      Self::EmptyBuilder => write!(f, "no regular expressions in the builder"),
      Self::Regex(e, _) => write!(f, "{e}"),
      Self::Mir(e) => write!(f, "{e}"),
    }
  }
}

/// A matcher for matching regular expressions.
#[derive(Debug)]
pub struct RegexMatcher<S, T> {
  table: StateTransTable<S, T>,
  state: usize,
}

impl<S, T> RegexMatcher<S, T> {
  /// Creates a new matcher from the given [`StateTransTable`].
  fn new(table: StateTransTable<S, T>) -> Self {
    Self {
      state: table.init_id(),
      table,
    }
  }

  /// Returns the current state ID.
  pub fn state(&self) -> usize {
    self.state
  }

  /// Checks if the given bytes can be matched.
  /// If so, returns a reference to the corresponding tag.
  /// Otherwise, returns [`None`].
  ///
  /// Smaller tags have higher precedence.
  pub fn is_match(&self, seq: &[S]) -> Option<&T>
  where
    S: Ord,
  {
    let mut id = self.table.init_id();
    for s in seq {
      if let Some(next) = self.table.next_state(id, s) {
        id = next;
      } else {
        return None;
      }
    }
    self.table.is_final(id)
  }

  /// Returns true if the given symbol can be accepted.
  ///
  /// This method will update the internal state.
  pub fn is_accept(&mut self, s: &S) -> bool
  where
    S: Ord,
  {
    if let Some(next) = self.table.next_state(self.state, s) {
      self.state = next;
      true
    } else {
      false
    }
  }

  /// Checks if the current state is a final state.
  /// If so, returns a reference to the corresponding tag.
  /// Otherwise, returns [`None`].
  ///
  /// Smaller tags have higher precedence.
  pub fn is_final(&self) -> Option<&T> {
    self.table.is_final(self.state)
  }

  /// Checks if the given state is a final state.
  /// If so, returns a reference to the corresponding tag.
  /// Otherwise, returns [`None`].
  ///
  /// Smaller tags have higher precedence.
  pub fn is_state_final(&self, id: usize) -> Option<&T> {
    self.table.is_final(id)
  }

  /// Resets the internal state of the current matcher to initial state.
  pub fn reset(&mut self) {
    self.state = self.table.init_id();
  }
}

impl<S, T> From<RegexMatcher<S, T>> for StateTransTable<S, T> {
  fn from(matcher: RegexMatcher<S, T>) -> Self {
    matcher.table
  }
}

/// A regular expression matcher for matching characters.
pub type CharsMatcher<T> = RegexMatcher<char, T>;

impl<T> CharsMatcher<T> {
  /// Checks if the given string can be matched.
  /// If so, returns a reference to the corresponding tag.
  /// Otherwise, returns [`None`].
  ///
  /// Smaller tags have higher precedence.
  pub fn is_str_match(&self, s: &str) -> Option<&T> {
    let mut id = self.table.init_id();
    for c in s.chars() {
      if let Some(next) = self.table.next_state(id, &c) {
        id = next;
      } else {
        return None;
      }
    }
    self.table.is_final(id)
  }
}

/// A regular expression matcher for matching bytes.
pub type BytesMatcher<T> = RegexMatcher<u8, T>;

impl<T> BytesMatcher<T> {
  /// Checks if the given string can be matched.
  /// If so, returns a reference to the corresponding tag.
  /// Otherwise, returns [`None`].
  ///
  /// Smaller tags have higher precedence.
  pub fn is_str_match(&self, s: &str) -> Option<&T> {
    let mut id = self.table.init_id();
    for c in s.bytes() {
      if let Some(next) = self.table.next_state(id, &c) {
        id = next;
      } else {
        return None;
      }
    }
    self.table.is_final(id)
  }
}

#[cfg(test)]
mod test {
  use super::*;
  use Token::*;

  #[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
  enum Token {
    Keyword,
    Identifier,
    Number,
    Str,
    Operator,
    Skip,
    Other,
  }

  #[test]
  fn match_string() {
    let matcher: CharsMatcher<_> = RegexBuilder::new()
      .add("if|else|while", Keyword)
      .add("[_a-zA-Z][_a-zA-Z0-9]*", Identifier)
      .add("[0-9]|[1-9][0-9]+", Number)
      .build()
      .unwrap();
    assert_eq!(matcher.is_str_match("if"), Some(&Keyword));
    assert_eq!(matcher.is_str_match("else"), Some(&Keyword));
    assert_eq!(matcher.is_str_match("while"), Some(&Keyword));
    assert_eq!(matcher.is_str_match("ifi"), Some(&Identifier));
    assert_eq!(matcher.is_str_match("else1"), Some(&Identifier));
    assert_eq!(matcher.is_str_match("_while"), Some(&Identifier));
    assert_eq!(matcher.is_str_match("a_8"), Some(&Identifier));
    assert_eq!(matcher.is_str_match("_"), Some(&Identifier));
    assert_eq!(matcher.is_str_match("A_good_id"), Some(&Identifier));
    assert_eq!(matcher.is_str_match("A_b@d_id"), None);
    assert_eq!(matcher.is_str_match("0"), Some(&Number));
    assert_eq!(matcher.is_str_match("5"), Some(&Number));
    assert_eq!(matcher.is_str_match("12450"), Some(&Number));
    assert_eq!(matcher.is_str_match("10"), Some(&Number));
    assert_eq!(matcher.is_str_match("01"), None);
    assert_eq!(matcher.is_str_match(""), None);
    assert_eq!(matcher.is_str_match("?"), None);
  }

  #[test]
  fn match_bytes() {
    let matcher: BytesMatcher<_> = RegexBuilder::new()
      .add("hello|hi", 0)
      .add("goodbye|bye", 1)
      .build_bytes()
      .unwrap();
    assert_eq!(matcher.is_str_match("hello"), Some(&0));
    assert_eq!(matcher.is_match(b"hello"), Some(&0));
    assert_eq!(matcher.is_match(b"hi"), Some(&0));
    assert_eq!(matcher.is_match(b"goodbye"), Some(&1));
    assert_eq!(matcher.is_match(&[0x62, 0x79, 0x65]), Some(&1));
  }

  #[test]
  fn match_stream() {
    use std::io::{Cursor, Read};

    struct Lexer<R> {
      reader: R,
      matcher: CharsMatcher<Token>,
      last_char: Option<char>,
    }

    impl<R> Lexer<R> {
      fn new(reader: R) -> Self {
        Self {
          reader,
          matcher: RegexBuilder::new()
            .add("if|else|while", Keyword)
            .add("[_a-zA-Z][_a-zA-Z0-9]*", Identifier)
            .add("[0-9]|[1-9][0-9]+", Number)
            .add("\"[^\"\r\n]*\"", Str)
            .add(r"==|>|-=|\+=", Operator)
            .add(r"\s+", Skip)
            .add(".", Other)
            .build()
            .unwrap(),
          last_char: None,
        }
      }

      fn unread(&mut self, c: char) {
        self.last_char = Some(c);
      }
    }

    impl<R> Lexer<R>
    where
      R: Read,
    {
      fn read(&mut self) -> Option<char> {
        let mut buf = [0];
        match self.last_char.take() {
          None => match self.reader.read(&mut buf) {
            Ok(1) => Some(buf[0] as char),
            _ => None,
          },
          c => c,
        }
      }

      fn next_token_impl(&mut self) -> Option<(Token, String)> {
        let mut last_state;
        let mut buf = String::new();
        self.matcher.reset();
        loop {
          let c = self.read()?;
          last_state = self.matcher.state();
          if !self.matcher.is_accept(&c) {
            self.unread(c);
            break;
          }
          buf.push(c);
        }
        self.matcher.is_state_final(last_state).map(|t| (*t, buf))
      }

      fn next_token(&mut self) -> Option<(Token, String)> {
        loop {
          let ts = self.next_token_impl();
          if !matches!(ts, Some((Skip, _))) {
            return ts;
          }
        }
      }
    }

    let mut lexer = Lexer::new(Cursor::new(
      r#"
      while (test(b) =="hello!") {
        if (b> 5){
          b-=1;
        } else {
          b += 2;
        }
      }
    "#,
    ));

    assert_eq!(lexer.next_token(), Some((Keyword, "while".into())));
    assert_eq!(lexer.next_token(), Some((Other, "(".into())));
    assert_eq!(lexer.next_token(), Some((Identifier, "test".into())));
    assert_eq!(lexer.next_token(), Some((Other, "(".into())));
    assert_eq!(lexer.next_token(), Some((Identifier, "b".into())));
    assert_eq!(lexer.next_token(), Some((Other, ")".into())));
    assert_eq!(lexer.next_token(), Some((Operator, "==".into())));
    assert_eq!(lexer.next_token(), Some((Str, "\"hello!\"".into())));
    assert_eq!(lexer.next_token(), Some((Other, ")".into())));
    assert_eq!(lexer.next_token(), Some((Other, "{".into())));
    assert_eq!(lexer.next_token(), Some((Keyword, "if".into())));
    assert_eq!(lexer.next_token(), Some((Other, "(".into())));
    assert_eq!(lexer.next_token(), Some((Identifier, "b".into())));
    assert_eq!(lexer.next_token(), Some((Operator, ">".into())));
    assert_eq!(lexer.next_token(), Some((Number, "5".into())));
    assert_eq!(lexer.next_token(), Some((Other, ")".into())));
    assert_eq!(lexer.next_token(), Some((Other, "{".into())));
    assert_eq!(lexer.next_token(), Some((Identifier, "b".into())));
    assert_eq!(lexer.next_token(), Some((Operator, "-=".into())));
    assert_eq!(lexer.next_token(), Some((Number, "1".into())));
    assert_eq!(lexer.next_token(), Some((Other, ";".into())));
    assert_eq!(lexer.next_token(), Some((Other, "}".into())));
    assert_eq!(lexer.next_token(), Some((Keyword, "else".into())));
    assert_eq!(lexer.next_token(), Some((Other, "{".into())));
    assert_eq!(lexer.next_token(), Some((Identifier, "b".into())));
    assert_eq!(lexer.next_token(), Some((Operator, "+=".into())));
    assert_eq!(lexer.next_token(), Some((Number, "2".into())));
    assert_eq!(lexer.next_token(), Some((Other, ";".into())));
    assert_eq!(lexer.next_token(), Some((Other, "}".into())));
    assert_eq!(lexer.next_token(), Some((Other, "}".into())));
    assert_eq!(lexer.next_token(), None);
  }

  #[test]
  fn match_word() {
    let matcher: CharsMatcher<_> = RegexBuilder::new().add(r"\w+", 0).build().unwrap();
    assert_eq!(matcher.is_str_match("if"), Some(&0));
    assert_eq!(matcher.is_str_match("hello"), Some(&0));
    assert_eq!(matcher.is_str_match(".hello"), None);
    assert_eq!(matcher.is_str_match("??"), None);
  }

  #[test]
  fn match_xeno_tokens() {
    let res = [
      r"\s+",
      r"(0b[01]+|0o[0-7]+|0x[0-9a-fA-F]+|[0-9]+)([iIuU](8|16|32|64))?",
      r"[0-9]+(\.([0-9]+([eE][+-]?[0-9]+)?([fF](32|64))?)?|([eE][+-]?[0-9]+)([fF](32|64))?|([fF](32|64)))",
      r#"'([^'\\\n\r\t]|\\'|\\"|\\x[0-7][0-9a-fA-F]|\\n|\\r|\\t|\\\\|\\0|\\u\{[0-9a-fA-F]{1,6}\})'"#,
      r#"b'([\x20-\x26\x28-\x5b\x5d-\x7e]|\\x[0-9a-fA-F]{2}|\\n|\\r|\\t|\\\\|\\0|\\'|\\")'"#,
      r#""([^'\\\n\r\t]|\\'|\\"|\\x[0-7][0-9a-fA-F]|\\n|\\r|\\t|\\\\|\\0|\\u\{[0-9a-fA-F]{1,6}\})*""#,
      r####"r"[^"]*"|r#"([^"]|"[^#])*"#|r##"([^"]|"[^#]|"#[^#])*"##|r###"([^"]|"[^#]|"#[^#]|"##[^#])*"###"####,
      r#"b"([\x20-\x26\x28-\x5b\x5d-\x7e]|\\x[0-9a-fA-F]{2}|\\n|\\r|\\t|\\\\|\\0|\\'|\\")*""#,
      r"\+|-|\*|/|%|&|\||!|\^|<<|>>|&&|\|\||==|!=|<|<=|>|>=|=|\+=|-=|\*=|/=|%=|&=|\|=|\^=|<<=|>>=|\(|\)|\[|\]|\{|\}|\.|\.\.|\.\.\.|->|,|:|@|_|\?",
      r"[~!@#$%^&*()_\-+={}\[\]|\\:;<,>.?/]+",
      r#"[^\s~!@#$%^&*()_\-+={}\[\]|\\:;<,>.?/0-9][^\s~!@#$%^&*()\-+={}\[\]|\\:;<,>.?/]*"#,
    ];
    let matcher: CharsMatcher<_> = res
      .iter()
      .enumerate()
      .fold(RegexBuilder::new(), |b, (i, re)| b.add(re, i))
      .build()
      .unwrap();
    assert_eq!(matcher.is_str_match("123"), Some(&1));
  }
}