Enum Rule 

pub enum Rule {
    Analytic(String, Vec<SpannableNode<Ident>>, Vec<SpannableNode<Rhs>>),
    Generate(String, Vec<SpannableNode<Ident>>, Vec<SpannableNode<Rhs>>),
    Import(String, ImportType, String),
    Exclude(String, Vec<SpannableNode<String>>),
}

A single rule in the WAG grammar.

Grammar

Rule -> Ident RuleType;
RuleType -> RealRule | ImportRule;
RealRule -> NTArgs? RuleArrow Rhs;
RuleArrow -> "->" | "=>";
ImportRule -> ImportArrow Identifier;
ImportArrow -> "<-" | "<=" | "<<" | "</";

NTArgs -> “<” AttrIdentifierList “>”;
AttrIdentifierList -> Ident “,” AttrIdentifierList | Ident;

Variants

Analytic(String, Vec<SpannableNode<Ident>>, Vec<SpannableNode<Rhs>>)

An analytic rule (->).

Generate(String, Vec<SpannableNode<Ident>>, Vec<SpannableNode<Rhs>>)

A generative rule (=>).

Import(String, ImportType, String)

An import rule (<-/=/<).

Exclude(String, Vec<SpannableNode<String>>)

An import exclude rule (</).

Implementations

impl Rule

pub fn new_unspanned_analytic( arg_0: String, arg_1: Vec<Ident>, arg_2: Vec<Rhs>, ) -> Self

Construct a Self::Analytic with dummy span information.

pub fn new_unspanned_generate( arg_0: String, arg_1: Vec<Ident>, arg_2: Vec<Rhs>, ) -> Self

Construct a Self::Generate with dummy span information.

pub fn new_unspanned_import( arg_0: String, arg_1: ImportType, arg_2: String, ) -> Self

Construct a Self::Import with dummy span information.

pub fn new_unspanned_exclude(arg_0: String, arg_1: Vec<String>) -> Self

Construct a Self::Exclude with dummy span information.

Trait Implementations

impl Debug for Rule

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

Formats the value using the given formatter.

impl Display for Rule

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

Formats the value using the given formatter.

impl Hash for Rule

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Parse for Rule

fn parse(lexer: &mut LexerBridge<'_>) -> ParseResult<Self>

Given a lexer, try to parse a valid instance of this node.

fn parse_sep( lexer: &mut LexerBridge<'_>, join: Tokens, ) -> ParseResult<Vec<Self>>

where Self: Sized,

Parse multiple instances of this node, separated by a Tokens.

fn parse_sep_end( lexer: &mut LexerBridge<'_>, join: Tokens, end: Tokens, ) -> ParseResult<Vec<Self>>

where Self: Sized,

Parse multiple instances of this node, separated by a Tokens end ended by a (possibly different) Tokens.

impl PartialEq for Rule

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

impl StructuralPartialEq for Rule