Struct inator::Parser

pub struct Parser<I: Clone + Ord> { /* private fields */ }

Nondeterministic finite automata with epsilon transitions.

Implementations

impl<I: Clone + Ord> Parser<I>

pub fn reverse(&self) -> Self

Reverse all transitions and swap initial with accepting states.

Panics

TODO

pub fn compile(&self) -> Dfa<I>

Brzozowski’s algorithm for minimizing automata.

impl<I: Clone + Ord> Graph<I>

pub fn void() -> Self

NFA with zero states.

pub fn empty() -> Self

NFA accepting only the empty string.

pub fn unit(singleton: I, fn_name: Option<&'static str>) -> Self

NFA accepting this exact token and only this exact token, only once.

pub fn take_all_epsilon_transitions(&self, queue: Vec<usize>) -> BTreeSet<usize>

Take every transition that doesn’t require input.

pub fn step(&self) -> Stepper<'_, I>

Step through each input token one at a time.

pub fn accept<Iter: IntoIterator>(&self, iter: Iter) -> boolwhere Iter::Item: Borrow<I>,

Decide whether an input belongs to the regular langage this NFA accepts.

pub fn reject<Iter: IntoIterator<Item = I>>(&self, iter: Iter) -> bool

Decide whether an input belongs to the regular langage this NFA accepts.

pub fn size(&self) -> usize

Number of states.

pub fn fuzz(&self) -> Result<Fuzzer<I>, NeverAccepts>

Randomly generate inputs that are all guaranteed to be accepted. NOTE: returns an infinite iterator! for input in automaton.fuzz()? will loop forever . . .

Errors

If this automaton never accepts any input.

pub fn would_ever_accept(&self) -> bool

Check if there exists a string this DFA will accept.

pub fn repeat(self) -> Self

Match at least one time, then as many times as we want. Note that if ANY number of times leads to an accepting state, we take it!

pub fn optional(self) -> Self

Match at most one time (i.e. ignore if not present).

pub fn star(self) -> Self

Match zero or more times (a.k.a. Kleene star).

Trait Implementations

impl Add for Parser<char>

type Output = Graph<char>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<I: Clone + Ord> BitOr for Parser<I>

type Output = Graph<I>

The resulting type after applying the | operator.

fn bitor(self, rhs: Self) -> Self::Output

Performs the | operation.

impl<I: Clone + Clone + Ord> Clone for Graph<I>

fn clone(&self) -> Graph<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Debug + Clone + Ord> Debug for Graph<I>

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

Formats the value using the given formatter.

impl<I: Clone + Ord> Default for Graph<I>

fn default() -> Self

Returns the “default value” for a type.

impl<I: Clone + Ord + Expression> Display for Graph<I>

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

Formats the value using the given formatter.

impl<I: Hash + Clone + Ord> Hash for Graph<I>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, I: Clone + Ord> IntoIterator for &'a Graph<I>

type Item = &'a State<I>

The type of the elements being iterated over.

type IntoIter = Iter<'a, State<I>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: Clone + Ord> IntoIterator for Graph<I>

type Item = State<I>

The type of the elements being iterated over.

type IntoIter = IntoIter<State<I>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: Ord + Clone + Ord> Ord for Graph<I>

fn cmp(&self, other: &Graph<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<I: PartialEq + Clone + Ord> PartialEq for Graph<I>

fn eq(&self, other: &Graph<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I: PartialOrd + Clone + Ord> PartialOrd for Graph<I>

fn partial_cmp(&self, other: &Graph<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I: Clone + Ord> Shr<(I, Option<&'static str>, Graph<I>)> for Parser<I>

type Output = Graph<I>

The resulting type after applying the >> operator.

fn shr( self, (token, fn_name, rhs): (I, Option<&'static str>, Nfa<I>) ) -> Self::Output

Performs the >> operation.

impl<I: Clone + Ord> Shr for Parser<I>

type Output = Graph<I>

The resulting type after applying the >> operator.

fn shr(self, rhs: Self) -> Self::Output

Performs the >> operation.

impl<I: Eq + Clone + Ord> Eq for Graph<I>

impl<I: Clone + Ord> StructuralEq for Graph<I>

impl<I: Clone + Ord> StructuralPartialEq for Graph<I>