Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
ToRegExp.h
Go to the documentation of this file.
1
6#pragma once
7
10
11#include "ToRegExpAlgebraic.h"
12
13namespace grammar {
14
15namespace convert {
16
17class ToRegExp {
18public:
26 template < class TerminalSymbolType, class NonterminalSymbolType >
28
32 template < class TerminalSymbolType, class NonterminalSymbolType >
34};
35
36template < class TerminalSymbolType, class NonterminalSymbolType >
39}
40
41template < class TerminalSymbolType, class NonterminalSymbolType >
44}
45
46} /* namespace covert */
47
48} /* namespace grammar */
49
Left regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages...
Definition: LeftRG.h:70
Right regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular language...
Definition: RightRG.h:70
static regexp::UnboundedRegExp< TerminalSymbolType > convert(const grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > &grammar)
Definition: ToRegExpAlgebraic.h:65
Definition: ToRegExp.h:17
static regexp::UnboundedRegExp< TerminalSymbolType > convert(const grammar::RightRG< TerminalSymbolType, NonterminalSymbolType > &grammar)
Definition: ToRegExp.h:37
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
Definition: converterCommon.hpp:8
Definition: ToAutomaton.h:24