Struct Cycles

pub struct Cycles<G> { /* private fields */ }

Provides information about cycles among unit derivations in the grammar. There are two ways of pruning cycles.

Implementations

impl<G> Cycles<G>

where G: RuleContainer,

pub fn new<'a>(grammar: &'a mut G) -> Cycles<&'a mut G>

Analyzes the grammar’s cycles.

pub fn cycle_free(&self) -> bool

Checks whether the grammar is cycle-free.

impl<'a, G> Cycles<&'a mut G>

where G: RuleContainer,

pub fn cycle_participants( &'a self, ) -> CycleParticipants<'a, G, impl Iterator<Item = RuleRef<'a>>>

Iterates over rules that participate in a cycle.

pub fn remove_cycles(&mut self)

Removes all rules that participate in a cycle. Doesn’t preserve the language represented by the grammar.

pub fn rewrite_cycles(&mut self)

Rewrites all rules that participate in a cycle. Preserves the language represented by the grammar.