|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <grammar/Regular/RightRG.h>#include <automaton/FSM/NFA.h>#include <automaton/FSM/DFA.h>#include <common/createUnique.hpp>Go to the source code of this file.
Data Structures | |
| class | automaton::convert::ToGrammarRightRG |
Namespaces | |
| namespace | automaton |
| namespace | automaton::convert |
Functions | |
| grammar::RightRG< SymbolType, StateType > | automaton::convert::grammar (automaton.getInitialState()) |
| grammar | automaton::convert::setTerminalAlphabet (automaton.getInputAlphabet()) |
| grammar | automaton::convert::setNonterminalAlphabet (automaton.getStates()) |
| automaton::convert::for (const auto &transition :automaton.getTransitions()) | |
| automaton::convert::if (automaton.getFinalStates().contains(automaton.getInitialState())) grammar.setGeneratesEpsilon(true) | |