Enum SPPFNode 

pub enum SPPFNode<L: GrammarLabel> {
    Dummy,
    Symbol(L::Symbol, usize, usize, Vec<SPPFNodeIndex>),
    Intermediate(L, usize, usize, Vec<SPPFNodeIndex>),
    Packed(L, usize, Vec<SPPFNodeIndex>),
}

Binary SPPF Node structure.

Each node can be one of: Dummy, Symbol, Intermediate and Packed.

Symbol is a Terminal or a Nonterminal.

Intermediate is a grammar rule with position.

Packed means different derivations of the same grammar rule.

Each grammar rule possible position corresponds to a label. So store labels for Intermediate and Packed rules.

Variants

Dummy

$ node in original paper

Symbol(L::Symbol, usize, usize, Vec<SPPFNodeIndex>)

(symbol, left, right, children)

Intermediate(L, usize, usize, Vec<SPPFNodeIndex>)

(label, left, right, children)

Packed(L, usize, Vec<SPPFNodeIndex>)

(label, split, children)

Implementations

impl<L: GrammarLabel> SPPFNode<L>

pub fn right_extent(&self) -> usize

Get right extent of the node, panics if it doesn’t have it.

pub fn left_extent(&self) -> usize

Get left extent of the node, panics if it doesn’t have it.

pub fn children(&self) -> Option<&Vec<SPPFNodeIndex>>

Get children node references.

Trait Implementations

impl<L: Clone + GrammarLabel> Clone for SPPFNode<L>

where L::Symbol: Clone,

fn clone(&self) -> SPPFNode<L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Ord + GrammarLabel> Ord for SPPFNode<L>

where L::Symbol: Ord,

fn cmp(&self, other: &SPPFNode<L>) -> 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,

Restrict a value to a certain interval.

impl<L: PartialEq + GrammarLabel> PartialEq for SPPFNode<L>

where L::Symbol: PartialEq,

fn eq(&self, other: &SPPFNode<L>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<L: PartialOrd + GrammarLabel> PartialOrd for SPPFNode<L>

where L::Symbol: PartialOrd,

fn partial_cmp(&self, other: &SPPFNode<L>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<L: Eq + GrammarLabel> Eq for SPPFNode<L>

where L::Symbol: Eq,

impl<L: GrammarLabel> StructuralPartialEq for SPPFNode<L>