Struct RegexTerminal 

pub struct RegexTerminal<'a> {
    pub automaton: DFA<&'a [u32]>,
    /* private fields */
}

A special type of Terminal which is a regex recognizer.

Implements label so that regex machines can be used. The string representation/uuid of the machine is its regex pattern.

Fields

automaton: DFA<&'a [u32]>

The regex automaton this terminal represents.

Implementations

impl<'a> RegexTerminal<'a>

pub const fn new(pattern: &'a str, automaton: DFA<&'a [u32]>) -> Self

Construct a new RegexTerminal.

Trait Implementations

impl<'a> Debug for RegexTerminal<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> Label<'a> for RegexTerminal<'a>

fn _first( &self, state: &mut GLLState<'a>, _: &mut HashSet<Rc<str>>, ) -> GLLResult<'a, bool>

A regex is sort of between a non-terminal and a terminal. They way first is used, we want it to return true if some terminal is parsable from this point. In the case of a regex, this means the pattern is accepting.

fn first_set( &self, _: &GLLState<'a>, ) -> ImplementationResult<'a, Vec<(Vec<GLLBlockLabel<'a>>, Option<Terminal<'a>>)>>

Returns the first-follow set of the label.

fn code(&self, _: &mut GLLState<'a>) -> GLLResult<'a, ()>

Any code to run when encountering this label.

fn _weight( &self, _: &GLLState<'a>, ) -> Option<ImplementationResult<'a, Value<'a>>>

Optionally return the weight of this label.

fn to_string(&self) -> &str

A string representation of the chunk (likely a GLL block) that this label represents.

fn str_parts(&self) -> Vec<&str>

The chunk represented by Label::to_string, but split by symbol into a vector.

fn uuid(&self) -> &str

A unique identifier for this label.

fn attr_rep_map(&self) -> (Vec<&str>, Vec<&str>)

A tuple of string representations for any associated attributes.

fn is_eps(&self) -> bool

Is this Label epsilon?

fn is_terminal(&self) -> bool

Is this label a terminal?

fn _is_nullable( &self, _: &GLLState<'a>, _: &mut HashSet<Rc<str>>, ) -> ImplementationResult<'a, bool>

Internal method for Label::is_nullable to do the recursive step.

fn first(&self, state: &mut GLLState<'a>) -> GLLResult<'a, bool>

Check if the next token in the current state is accepted by this label’s first-follow set.

fn is_nullable(&self, state: &GLLState<'a>) -> ImplementationResult<'a, bool>

Could this label resolve to epsilon?

fn weight(&self, state: &GLLState<'a>) -> ImplementationResult<'a, Value<'a>>

Returns either the weight of this label as calculated by _weight, or 1.