Enum lrpar::Node

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

A generic parse tree.

Variants§

§

Term

Fields

§lexeme: LexemeT

Terminals store a single lexeme.

§

Nonterm

Fields

§ridx: RIdx<StorageT>
§nodes: Vec<Node<LexemeT, StorageT>>

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

Implementations§

source§

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

source

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

Return a pretty-printed version of this node.

Trait Implementations§

source§

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

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

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

source§

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

Formats the value using the given formatter. Read more
source§

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

source§

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

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

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.
source§

impl<LexemeT: Lexeme<StorageT>, StorageT> StructuralPartialEq for Node<LexemeT, StorageT>

Auto Trait Implementations§

§

impl<LexemeT, StorageT> Freeze for Node<LexemeT, StorageT>
where LexemeT: Freeze, StorageT: Freeze,

§

impl<LexemeT, StorageT> RefUnwindSafe for Node<LexemeT, StorageT>
where LexemeT: RefUnwindSafe, StorageT: RefUnwindSafe,

§

impl<LexemeT, StorageT> Send for Node<LexemeT, StorageT>
where LexemeT: Send, StorageT: Send,

§

impl<LexemeT, StorageT> Sync for Node<LexemeT, StorageT>
where LexemeT: Sync, StorageT: Sync,

§

impl<LexemeT, StorageT> Unpin for Node<LexemeT, StorageT>
where LexemeT: Unpin, StorageT: Unpin,

§

impl<LexemeT, StorageT> UnwindSafe for Node<LexemeT, StorageT>
where LexemeT: UnwindSafe, StorageT: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.