Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
ToGrammar.h
Go to the documentation of this file.
1
6#pragma once
7
9
10namespace regexp {
11
12namespace convert {
13
19class ToGrammar {
20public:
30 template < class SymbolType >
32
36 template < class SymbolType >
38
39};
40
41template < class SymbolType >
44}
45
46template < class SymbolType >
49}
50
51} /* namespace convert */
52
53} /* namespace regexp */
54
Right regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular language...
Definition: RightRG.h:70
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 grammar::RightRG< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::FormalRegExp< SymbolType > &regexp)
Definition: ToGrammarRightRGGlushkov.h:110
Definition: ToGrammar.h:19
static grammar::RightRG< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::FormalRegExp< SymbolType > &regexp)
Definition: ToGrammar.h:42
Definition: converterCommon.hpp:8
Definition: ToAutomaton.h:15