#include <ToPostfixPushdownAutomaton.h>

Static Public Member Functions
template<class SymbolType , class StateType >
static automaton::DPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< StateType, alphabet::BottomOfTheStackSymbol >, char >	convert (const automaton::DFTA< SymbolType, StateType > &dfta)

template<class SymbolType , class StateType >
static automaton::NPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< StateType, alphabet::BottomOfTheStackSymbol >, char >	convert (const automaton::NFTA< SymbolType, StateType > &nfta)

Detailed Description

Converts a finite tree automaton (FTA) to a pushdown automaton (PDA) that reads linearised trees in their postfix notation.

Member Function Documentation

◆ convert() [1/2]

template<class SymbolType , class StateType >

automaton::DPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< StateType, alphabet::BottomOfTheStackSymbol >, char > automaton::convert::ToPostfixPushdownAutomaton::convert ( const automaton::DFTA< SymbolType, StateType > & dfta )

static

Performs the conversion of the deterministic FTA to the deterministic PDA

Parameters

dfta	Deterministic finite tree automaton to convert

Returns: (D)PDA equivalent to original finite tree automaton reading linearized postfix tree

Here is the call graph for this function:

Here is the caller graph for this function:

◆ convert() [2/2]

template<class SymbolType , class StateType >

automaton::NPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< StateType, alphabet::BottomOfTheStackSymbol >, char > automaton::convert::ToPostfixPushdownAutomaton::convert ( const automaton::NFTA< SymbolType, StateType > & nfta )