Struct treebender::rules::Grammar

pub struct Grammar {
    pub start: String,
    pub rules: HashMap<String, Vec<Rc<Rule>>>,
    // some fields omitted
}

Fields

start: String

rules: HashMap<String, Vec<Rc<Rule>>>

Implementations

impl Grammar

pub fn new(rules: Vec<Rule>) -> Result<Self, Err>

pub fn is_nullable(&self, s: &str) -> bool

impl Grammar

pub fn parse_chart(&self, input: &[&str]) -> Chart

pub fn parse_forest(&self, input: &[&str]) -> Forest

pub fn unify_tree(
    tree: SynTree<Rc<Rule>, String>
) -> Result<(SynTree<String, String>, NodeRef), Err>

pub fn parse(&self, input: &[&str]) -> Vec<(SynTree<String, String>, NodeRef)>

pub fn read_from_file<P: AsRef<Path>>(path: P) -> Result<Self, Err>

Trait Implementations

impl Debug for Grammar

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

Formats the value using the given formatter.

impl Display for Grammar

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

Formats the value using the given formatter.

impl FromStr for Grammar

Parses a str into a tuple of (rules, nonterminals) Errors if the grammar doesn’t parse or is malformed

type Err = Err

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a grammar from a string. Assumes the first rule’s symbol is the start symbol.