Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
RegExpIterate.h
Go to the documentation of this file.
1
6#pragma once
7
10
13
14namespace regexp {
15
16namespace transform {
17
23public:
33 template < class SymbolType >
35
39 template < class SymbolType >
41
45 template < class SymbolType >
47
51 template < class SymbolType >
53};
54
55template < class SymbolType >
58}
59
60template < class SymbolType >
63}
64
65template < class SymbolType >
68}
69
70template < class SymbolType >
73}
74
75} /* namespace transform */
76
77} /* namespace regexp */
78
Represents the iteration operator in the regular expression. The node has exactly one child.
Definition: FormalRegExpIteration.h:44
Represents formal regular expression structure. Regular expression is stored as a tree of FormalRegEx...
Definition: FormalRegExpStructure.h:45
Formal regular expression represents regular expression. It describes regular languages....
Definition: FormalRegExp.h:78
Represents the iteration operator in the regular expression. The node has exactly one child.
Definition: UnboundedRegExpIteration.h:43
Represents unbounded regular expression structure. Regular expression is stored as a tree of Unbounde...
Definition: UnboundedRegExpStructure.h:47
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
Definition: RegExpIterate.h:22
static regexp::FormalRegExp< SymbolType > iterate(const regexp::FormalRegExp< SymbolType > &regexp)
Definition: RegExpIterate.h:56
ContainerType< ResType > transform(const ContainerType< InType, Ts ... > &in, Callback transform)
In container tranformation of all elements according to the tranform.
Definition: algorithm.hpp:150
Definition: ToAutomaton.h:15