22 template <
class SymbolType >
30 template <
class SymbolType >
35template <
class SymbolType >
37 if ( state.empty ( ) )
41 for (
unsigned label : state )
45 repeatsInternal ( originalTree,
automaton,
repeats, transition.second, size + 1, ac - 1 + transition.first.second.getRank ( ) );
48template <
class SymbolType >
53 repeatsInternal (
tree, deterministicSubtreePushdownAutomaton, data, deterministicSubtreePushdownAutomaton.
getInitialState ( ), 0, 1 );
static automaton::InputDrivenNPDA< common::ranked_symbol< SymbolType >, char, unsigned > construct(const tree::PrefixRankedTree< SymbolType > &tree)
Definition: ExactSubtreeAutomaton.h:27
Definition: ExactSubtreeRepeatsFromSubtreeAutomaton.h:21
static tree::PrefixRankedTree< unsigned > repeats(const tree::PrefixRankedTree< SymbolType > &tree)
Definition: ExactSubtreeRepeatsFromSubtreeAutomaton.h:49
static automaton::DFA< SymbolType, StateType > determinize(const automaton::DFA< SymbolType, StateType > &automaton)
Definition: Determinize.h:276
Definition: ranked_symbol.hpp:20
Class extending the pair class from the standard library. Original reason is to allow printing of the...
Definition: pair.hpp:43
Class extending the vector class from the standard library. Original reason is to allow printing of t...
Definition: vector.hpp:45
Tree structure represented as linear sequece as result of preorder traversal. The representation is s...
Definition: PrefixRankedTree.h:71
const ext::vector< common::ranked_symbol< SymbolType > > & getContent() const &
Definition: PrefixRankedTree.h:235
Definition: BoyerMooreHorspool.h:22
Definition: ToGrammar.h:31
Definition: FailStateLabel.cpp:12
Definition: BackwardOccurrenceTest.h:17