Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
ToPostfixPushdownAutomatonGlushkov.h
Go to the documentation of this file.
1
6#pragma once
7
8#include "ToFTAGlushkov.h"
10
11namespace rte {
12
13namespace convert {
14
23
24public:
35 template < class SymbolType >
37};
38
39template < class SymbolType >
42}
43
44} /* namespace convert */
45
46} /* namespace rte */
47
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
static automaton::DPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< StateType, alphabet::BottomOfTheStackSymbol >, char > convert(const automaton::DFTA< SymbolType, StateType > &dfta)
Definition: ToPostfixPushdownAutomaton.h:61
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::NFTA< SymbolType, ext::set< common::ranked_symbol< ext::pair< SymbolType, unsigned > > > > convert(const rte::FormalRTE< SymbolType > &rte)
Definition: ToFTAGlushkov.h:54
Definition: ToPostfixPushdownAutomatonGlushkov.h:22
static automaton::NPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< ext::set< common::ranked_symbol< ext::pair< SymbolType, unsigned > > >, alphabet::BottomOfTheStackSymbol >, char > convert(const rte::FormalRTE< SymbolType > &rte)
Definition: ToPostfixPushdownAutomatonGlushkov.h:40
Definition: converterCommon.hpp:8
Definition: ToFTAGlushkov.h:22