Struct two_timer::MATCHER

pub struct MATCHER { /* fields omitted */ }

Methods from Deref<Target = Matcher>

pub fn parse(&self, s: &'t str) -> Option<Match<'t>>

Returns Some(Match) if the grammar can parse the string. Note that unless the grammar is string-bounded, this only means it can parse the string at some point.

Examples

let m = grammar!{
 
    (?bB)
 
    S -> r(r"\A") <subject> <VP> r(r"\.\z")
 
    subject           => [["Amy", "Bob", "Carter", "Dianne"]]
    VP                -> <verb_intransitive> | <verb_transitive> <object>
    verb_intransitive => [["naps", "doodles", "exercises", "meditates"]]
    verb_transitive   => [["eats", "programs", "sees", "throws"]]
    object            => (?w) [["a sandwich", "eggs", "the sunset"]]
 
}.matcher()?;
 
let parse_tree = m.parse("Amy programs the sunset.").unwrap();
 
println!("{}", parse_tree);
 
// S (0, 24): "Amy programs the sunset."
//   subject (0, 3): "Amy"
//   VP (4, 23): "programs the sunset"
//     verb_transitive (4, 12): "programs"
//     object (13, 23): "the sunset"

pub fn is_match(&self, text: &str) -> bool

Returns whether the grammar can parse the string. This is a cheaper operation than parsing.

Examples

let m = grammar!{
 
    (?bB)
 
    S -> r(r"\A") <subject> <VP> r(r"\.\z")
 
    subject           => [["Amy", "Bob", "Carter", "Dianne"]]
    VP                -> <verb_intransitive> | <verb_transitive> <object>
    verb_intransitive => [["naps", "doodles", "exercises", "meditates"]]
    verb_transitive   => [["eats", "programs", "sees", "throws"]]
    object            => (?w) [["a sandwich", "eggs", "the sunset"]]
 
}.matcher()?;
 
assert!(m.is_match("Bob doodles."));

Trait Implementations

impl Deref for MATCHER

type Target = Matcher

The resulting type after dereferencing.

fn deref(&self) -> &Matcher

Dereferences the value.

impl LazyStatic for MATCHER

fn initialize(lazy: &Self)