rte::convert::ToPostfixPushdownAutomaton Class Reference

#include <ToPostfixPushdownAutomaton.h>

Static Public Member Functions
template<class SymbolType >
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)

Detailed Description

Converts a tree regular expression to a pushdown automaton.

This class serves as a "default wrapper" over the conversion of RTE to PDA. It delegates to the conversion algorithm similar to glushkov construction.

See also

rte::convert::ToPostfixPushdownAutomatonGlushkov

Member Function Documentation

convert()

template<class SymbolType >

automaton::NPDA< ext::variant< common::ranked_symbol< SymbolType >, alphabet::EndSymbol >, ext::variant< common::ranked_symbol< ext::pair< SymbolType, unsigned > >, alphabet::BottomOfTheStackSymbol >, char > rte::convert::ToPostfixPushdownAutomaton::convert ( const rte::FormalRTE< SymbolType > &  rte )

static

Implements conversion of the tree regular expressions to a pushdown automaton using Glushkov's method of neighbours.

Template Parameters

SymbolType	the type of symbols in the regular expression
RankType	the type of symbol ranks in the regular expression

Parameters

regexp

the regexp to convert

Returns

PDA equivalent to original regular rte expression reading linearized postfix tree

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• alib2algo/src/rte/convert/ToPostfixPushdownAutomaton.h