Enum lrpar::Node

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

A generic parse tree.

Variants

Term

Terminals store a single lexeme.

Fields of Term

lexeme: Lexeme<StorageT>

Nonterm

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

Fields of Nonterm

ridx: RIdx<StorageT>nodes: Vec<Node<StorageT>>

Methods

impl<StorageT: 'static + PrimInt + Unsigned> Node<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<StorageT: Clone> Clone for Node<StorageT>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<StorageT: Debug> Debug for Node<StorageT>

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

Formats the value using the given formatter.

impl<StorageT: PartialEq> PartialEq<Node<StorageT>> for Node<StorageT>

fn eq(&self, other: &Node<StorageT>) -> bool

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

fn ne(&self, other: &Node<StorageT>) -> bool

This method tests for !=.

impl<StorageT> StructuralPartialEq for Node<StorageT>