|
template<class F_PickAction >
requires requires (int tag, const C_Conflict &conflict) { { pickAction(tag, conflict) }->std::convertible_to<T_Action>; } |
| C_DFA (const C_NFA< T_Inputs, T_Action, C_Traits > &nfa, F_PickAction pickAction) |
|
template<class F_Get >
requires std::invocable<F_Get,int,const T_Action&> |
void | eachFinalState (F_Get get) const |
|
template<class F_Get >
requires std::invocable<F_Get,int,const T_Inputs&,int> |
void | eachTransition (F_Get get) const |
|
bool | isFinal (int state, T_Action &action) const |
|
size_t | totalFinalStates () const |
|
template<class T_Inputs, class T_Action, class C_Traits = C_FA_Traits<T_Inputs>>
class bux::C_DFA< T_Inputs, T_Action, C_Traits >
- Parameters
-
T_Inputs | Set of inputs |
T_Action | Type of action on final state. |
C_Traits | Collection of compile-time decisions |
DFA stands for Deterministic Finite Automoton
- Examples
- parsergen/ScannerGen/main.cpp.
Definition at line 123 of file FA.h.