Skip to content
Snippets Groups Projects
Commit 889cdfb8 authored by Jan Trávníček's avatar Jan Trávníček
Browse files

fix typo

parent 4420f89a
No related branches found
No related tags found
No related merge requests found
...@@ -58,42 +58,6 @@ regexp::RegExp StateElimination::convert(const T& automaton) ...@@ -58,42 +58,6 @@ regexp::RegExp StateElimination::convert(const T& automaton)
} }
   
   
void StateElimination::Visit(void* data, const automaton::EpsilonNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::MultiInitialStateNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::NFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::DFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::ExtendedNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::CompactNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
automaton::ExtendedNFA StateElimination::eliminateState(const automaton::ExtendedNFA& extendedAutomaton, const automaton::State& q) automaton::ExtendedNFA StateElimination::eliminateState(const automaton::ExtendedNFA& extendedAutomaton, const automaton::State& q)
{ {
automaton::ExtendedNFA newAutomaton(extendedAutomaton.getInitialState()); // sure that q is neither initial nor final (follows from step 2 - extending ExtendedNFA) automaton::ExtendedNFA newAutomaton(extendedAutomaton.getInitialState()); // sure that q is neither initial nor final (follows from step 2 - extending ExtendedNFA)
...@@ -167,6 +131,42 @@ void StateElimination::extendExtendedNFA(automaton::ExtendedNFA& automaton) ...@@ -167,6 +131,42 @@ void StateElimination::extendExtendedNFA(automaton::ExtendedNFA& automaton)
} }
} }
   
void StateElimination::Visit(void* data, const automaton::EpsilonNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::MultiInitialStateNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::NFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::DFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::ExtendedNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
void StateElimination::Visit(void* data, const automaton::CompactNFA& automaton) const
{
regexp::RegExp* & out = *((regexp::RegExp**) data);
out = new regexp::RegExp(convert(automaton));
}
const StateElimination StateElimination::STATE_ELIMINATION; const StateElimination StateElimination::STATE_ELIMINATION;
   
} /* namespace fa2re */ } /* namespace fa2re */
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment