Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
ToAutomaton.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <alib/pair>
9
12
13#include "ToAutomatonGlushkov.h"
14
15namespace regexp {
16
17namespace convert {
18
25public:
35 template < class SymbolType >
37
47 template < class SymbolType >
49
50};
51
52template < class SymbolType >
55}
56
57template < class SymbolType >
60}
61
62} /* namespace convert */
63
64} /* namespace regexp */
65
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
Formal regular expression represents regular expression. It describes regular languages....
Definition: FormalRegExp.h:78
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
static automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::UnboundedRegExp< SymbolType > &regexp)
Definition: ToAutomatonGlushkov.h:58
Definition: ToAutomaton.h:24
static automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::FormalRegExp< SymbolType > &regexp)
Definition: ToAutomaton.h:53
Definition: converterCommon.hpp:8
Definition: ToAutomaton.h:15