1
2
3
4
5
6
7
8
9
10
11
12
13
14

use super::Alphabet;
use super::nfa::Nfa;

/// Represents regular expressions over some finite alphabet.
pub struct Regex<A: Alphabet>(A);

impl<A: Alphabet> Regex<A> {
    /// Idea:
    ///
    /// Is like a regex-labeled nfa with only one final state.
    pub fn to_nfa(self) -> Nfa<A> {
        unimplemented!()
    }
}