Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
ToPostfixPushdownAutomaton.h
Go to the documentation of this file.
1
6#pragma once
7
11
12namespace rte {
13
14namespace convert {
15
24public:
35 template < class SymbolType >
37
38};
39
40template < class SymbolType >
43}
44
45} /* namespace convert */
46
47} /* namespace rte */
48
Represents bottom of the stack symbol used in the visibly pushdown automata.
Definition: BottomOfTheStackSymbol.h:35
Represents end symbol used as termation symbol of a string.
Definition: EndSymbol.h:35
Definition: NPDA.h:74
Implementation of the variant class allowing to store any type of those listed in the template parame...
Definition: variant.hpp:98
Formal regular tree expression represents regular tree expression. It describes regular tree language...
Definition: FormalRTE.h:71
static automaton::NPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< common::ranked_symbol< ext::pair< SymbolType, unsigned > >, alphabet::BottomOfTheStackSymbol >, char > convert(const rte::FormalRTE< SymbolType > &rte)
Definition: ToPostfixPushdownAutomatonGlushkovNaive.h:51
Definition: ToPostfixPushdownAutomaton.h:23
static automaton::NPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< common::ranked_symbol< ext::pair< SymbolType, unsigned > >, alphabet::BottomOfTheStackSymbol >, char > convert(const rte::FormalRTE< SymbolType > &rte)
Definition: ToPostfixPushdownAutomaton.h:41
Definition: converterCommon.hpp:8
Definition: ToFTAGlushkov.h:22