Struct TagStringDecompositionAutomaton 

pub struct TagStringDecompositionAutomaton { /* private fields */ }

Lazy decomposition automaton for a fixed TAG string value.

Implementations

impl TagStringDecompositionAutomaton

pub fn len(&self) -> usize

Return the number of tokens in the fixed input.

pub fn is_empty(&self) -> bool

Return whether the fixed input is empty.

Trait Implementations

impl BottomUpTa for TagStringDecompositionAutomaton

type State = TagSpan

State type carried by the automaton.

fn step( &self, symbol: Symbol, children: &[TagSpan], out: &mut dyn FnMut(TagSpan), )

Report all possible parent states for f(children...).

fn is_accepting(&self, state: &TagSpan) -> bool

Return whether q is an accepting state.

impl Clone for TagStringDecompositionAutomaton

fn clone(&self) -> TagStringDecompositionAutomaton

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CondensedTa for TagStringDecompositionAutomaton

fn condensed_rules(&self, out: &mut dyn FnMut(&[TagSpan], &SymbolSet, TagSpan))

Enumerate every distinct (children, result) pair, reporting the set of symbols that have that shape.

fn condensed_nullary_rules(&self, out: &mut dyn FnMut(&SymbolSet, TagSpan))

Enumerate condensed nullary rules.

fn condensed_rules_by_child( &self, position: usize, state: &TagSpan, out: &mut dyn FnMut(&[TagSpan], &SymbolSet, TagSpan), )

Enumerate condensed rules whose child at position is state.

impl Debug for TagStringDecompositionAutomaton

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

Formats the value using the given formatter.

impl IndexedBottomUpTa for TagStringDecompositionAutomaton

fn step_partial( &self, symbol: Symbol, position: usize, state_at_position: &TagSpan, out: &mut dyn FnMut(&[TagSpan], TagSpan), )

Report every rule f(children...) -> q where children[position] equals state_at_position.

impl StateUniverse for TagStringDecompositionAutomaton

fn all_states(&self, out: &mut dyn FnMut(TagSpan))

Report every state in the finite universe exactly once.

impl TopDownTa for TagStringDecompositionAutomaton

fn step_topdown( &self, parent: &TagSpan, out: &mut dyn FnMut(Symbol, &[TagSpan]), )

Report every rule f(children...) -> parent.

fn initial_states(&self, out: &mut dyn FnMut(TagSpan))

Report the initial states of the top-down view.