Struct ParseTree 

pub struct ParseTree<'gram> {
    pub lhs: &'gram Term,
    /* private fields */
}

A tree derived by successfully parsing an input string via Grammar::parse_input

Fields

lhs: &'gram Term

the “left hand side” Term used for this ParseTree

Implementations

impl<'gram> ParseTree<'gram>

pub fn mermaid(&self) -> MermaidParseTree<'_>

Opt into formatting as Mermaid.js flowchart.

let grammar: Grammar = "<dna> ::= <base> | <base> <dna>
<base> ::= 'A' | 'C' | 'G' | 'T'"
.parse()
.unwrap();

let input = "GATTACA";
let parsed = grammar.parse_input(input).next().unwrap();
let mermaid = parsed.mermaid().to_string();
println!("parse tree mermaid: {}", mermaid);

pub fn rhs_iter(&self) -> impl Iterator<Item = &ParseTreeNode<'_>>

Iterate the “right hand side” parse tree nodes

pub fn rhs_iter_mut<'a>( &'a mut self, ) -> impl Iterator<Item = &'a mut ParseTreeNode<'gram>>

Mutably iterate the “right hand side” parse tree nodes

Trait Implementations

impl<'gram> Clone for ParseTree<'gram>

fn clone(&self) -> ParseTree<'gram>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'gram> Debug for ParseTree<'gram>

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

Formats the value using the given formatter.

impl<'gram> Display for ParseTree<'gram>

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

Formats the value using the given formatter.

impl<'gram> PartialEq for ParseTree<'gram>

fn eq(&self, other: &ParseTree<'gram>) -> 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<'gram> Eq for ParseTree<'gram>

impl<'gram> StructuralPartialEq for ParseTree<'gram>