Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Occurrences.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <string/LinearString.h>
10
11#include "Run.h"
12#include <automaton/FSM/DFA.h>
13#include <automaton/TA/DFTA.h>
18#include <automaton/PDA/DPDA.h>
19
20#include <alib/deque>
21
22namespace automaton {
23
24namespace run {
25
31public:
43 template < class SymbolType, class StateType >
45
58 template < class SymbolType, class StateType >
60
61 template < class SymbolType, class StateType >
63
76 template < class SymbolType, class StateType >
78
91 template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
93
106 template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
108
121 template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
123
136 template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
138
139};
140
141template < class SymbolType, class StateType >
143 ext::tuple < bool, StateType, ext::set < unsigned > > res = Run::calculateState ( automaton, string );
144
145 return std::get < 2 > ( res );
146}
147
148template < class SymbolType, class StateType >
151
152 return std::get < 2 > ( res );
153}
154
155template < class SymbolType, class StateType >
158
159 return std::get < 2 > ( res );
160}
161
162template < class SymbolType, class StateType >
165
166 return std::get < 2 > ( res );
167}
168
169template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
172
173 return std::get < 2 > ( res );
174}
175
176template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
179
180 return std::get < 2 > ( res );
181}
182
183template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
186
187 return std::get < 2 > ( res );
188}
189
190template < class InputSymbolType, class PushdownStoreSymbolType, class StateType >
193
194 return std::get < 2 > ( res );
195}
196
197} /* namespace run */
198
199} /* namespace automaton */
200
Deterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree la...
Definition: ArcFactoredDeterministicZAutomaton.h:65
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages.
Definition: DFTA.h:74
Deterministic pushdown automaton. Accepts subset of context free languages.
Definition: DPDA.h:78
Deterministic input driven pushdown automaton. Accepts subset of context free languages.
Definition: InputDrivenDPDA.h:79
Deterministic real time height deterministic pushdown automaton. Accepts subset of context free langu...
Definition: RealTimeHeightDeterministicDPDA.h:89
Deterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree langu...
Definition: UnorderedDFTA.h:72
Deterministic visibly pushdown automaton. Accepts subset of context free languages.
Definition: VisiblyPushdownDPDA.h:86
Implementation of automaton run over its input reporting occurrences .
Definition: Occurrences.h:30
static ext::set< unsigned > occurrences(const automaton::DFA< SymbolType, StateType > &automaton, const string::LinearString< SymbolType > &string)
Definition: Occurrences.h:142
Class extending the deque class from the standard library. Original reason is to allow printing of th...
Definition: deque.hpp:44
Definition: set.hpp:44
Class extending the tuple class from the standard library. Original reason is to allow printing of th...
Definition: tuple.hpp:42
Linear string.
Definition: LinearString.h:57
Tree structure represented in its natural representation. The representation is so called ranked,...
Definition: RankedTree.h:72
Tree structure represented in its natural representation. The representation is so called ranked,...
Definition: UnorderedRankedTree.h:70
Tree represented in its natural representation. The representation is so called unranked,...
Definition: UnrankedTree.h:69
return res
Definition: MinimizeByPartitioning.h:145
Definition: ToGrammar.h:31
Definition: BackwardOccurrenceTest.h:17