Struct lrp::lalr::Lalr

pub struct Lalr<T>
where
    T: PartialEq + Ord + Clone + Debug,
{
    pub table: Tabler<T>,
    pub raws: Map<State<T>, State<T>>,
}

Fields

table: Tabler<T>

raws: Map<State<T>, State<T>>

Describes the “raw states” (states without lookahead symbol) in table.kernels, using it raw kernel as key and value being its final kernel

Implementations

impl<T> Lalr<T>

where T: PartialEq + Ord + Clone + Debug,

pub fn proc_closures_first_row(&mut self)

pub fn without_look(state: &State<T>) -> State<T>

pub fn prop_closure(&self, seed: State<T>) -> State<T>

pub fn update_closures( &mut self, main: &State<T>, inc: State<T>, closures: State<T> ) -> Option<State<T>>

pub fn update_state( &mut self, main: &State<T>, inc: State<T>, closures: State<T> ) -> Option<State<T>>

Trait Implementations

impl<T> Clone for Lalr<T>

where T: PartialEq + Ord + Clone + Debug + Clone,

fn clone(&self) -> Lalr<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Lalr<T>

where T: PartialEq + Ord + Clone + Debug + Debug,

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

Formats the value using the given formatter.

impl<T> Ord for Lalr<T>

where T: PartialEq + Ord + Clone + Debug + Ord,

fn cmp(&self, other: &Lalr<T>) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T> Parser<T> for Lalr<T>

where T: PartialEq + Ord + Clone + Debug,

fn new(grammar: Grammar<T>) -> Self

where Self: Sized,

fn with_table(table: Tabler<T>) -> Self

fn uninit(table: Tabler<T>) -> Self

fn tables(&self) -> &Tabler<T>

fn tables_mut(&mut self) -> &mut Tabler<T>

fn final_kernel<'a>(&'a self, kernel: &'a State<T>) -> Option<&'a State<T>>

fn dfa<M, I: Iterator<Item = Token<M, T>>>( &self, buffer: I, maps: ReductMap<M, T> ) -> Dfa<M, T, I>

where M: Clone,

fn simple_dfa<I: IntoIterator<Item = Token<(), T>>>( &self, buffer: I ) -> Dfa<(), T, I::IntoIter>

fn cloned<I: Iterator<Item = Token<T, T>>>(&self) -> ReductMap<T, T>

fn empty<I: Iterator<Item = Token<(), T>>>(&self) -> ReductMap<(), T>

fn parse<M, I: IntoIterator<Item = Token<M, T>>>( &self, buffer: I, maps: ReductMap<M, T> ) -> BaseResult<M, Error<T>>

where M: Clone,

Errors

fn validate<I: IntoIterator<Item = Token<(), T>>>(&self, buffer: I) -> bool

Runs Parser::parse and checks by errors

fn state_from_kernel(&self, kernel: &State<T>) -> Option<usize>

Returns the state’s index generated from that passed kernel

fn merged(states: State<T>) -> State<T>

Merges positions that contains the same body, but different lookaheads. I.e: merged({ [S -> C.C; $], [S -> C.C; c]}) = { [S -> C.C; $ c] }

fn reduce_equals(&mut self)

impl<T> PartialEq for Lalr<T>

where T: PartialEq + Ord + Clone + Debug + PartialEq,

fn eq(&self, other: &Lalr<T>) -> 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<T> PartialOrd for Lalr<T>

where T: PartialEq + Ord + Clone + Debug + PartialOrd,

fn partial_cmp(&self, other: &Lalr<T>) -> 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<T> Eq for Lalr<T>

where T: PartialEq + Ord + Clone + Debug + Eq,

impl<T> StructuralEq for Lalr<T>

where T: PartialEq + Ord + Clone + Debug,

impl<T> StructuralPartialEq for Lalr<T>

where T: PartialEq + Ord + Clone + Debug,