Enum lrpar::Node

pub enum Node<LexemeT: Lexeme<StorageT>, StorageT> {
    Term {
        lexeme: LexemeT,
    },
    Nonterm {
        ridx: RIdx<StorageT>,
        nodes: Vec<Node<LexemeT, StorageT>>,
    },
}

A generic parse tree.

Variants

Term

Terminals store a single lexeme.

Fields

lexeme: LexemeT

Nonterm

Nonterminals reference a rule and have zero or more Nodes as children.

Fields

ridx: RIdx<StorageT>

nodes: Vec<Node<LexemeT, StorageT>>

Implementations

impl<LexemeT: Lexeme<StorageT>, StorageT: 'static + PrimInt + Unsigned> Node<LexemeT, StorageT>

where usize: AsPrimitive<StorageT>,

pub fn pp(&self, grm: &YaccGrammar<StorageT>, input: &str) -> String

Return a pretty-printed version of this node.

Trait Implementations

impl<LexemeT: Clone + Lexeme<StorageT>, StorageT: Clone> Clone for Node<LexemeT, StorageT>

fn clone(&self) -> Node<LexemeT, StorageT>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<LexemeT: Debug + Lexeme<StorageT>, StorageT: Debug> Debug for Node<LexemeT, StorageT>

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

Formats the value using the given formatter.

impl<LexemeT: PartialEq + Lexeme<StorageT>, StorageT: PartialEq> PartialEq for Node<LexemeT, StorageT>

fn eq(&self, other: &Node<LexemeT, StorageT>) -> 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<LexemeT: Lexeme<StorageT>, StorageT> StructuralPartialEq for Node<LexemeT, StorageT>