rte::convert::ToPostfixPushdownAutomatonGlushkov Class Reference

#include <ToPostfixPushdownAutomatonGlushkov.h>

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

Detailed Description

Converts regular tree expression to a real-time height-deterministic pda

Sources:

• Tomas Pecka, Master Thesis 2016
• Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression @ SLATE 2018

Member Function Documentation

convert()

template<class SymbolType >

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

static

Implements conversion of the regular tree expressions to a real-time height-deterministic pushdown automaton using algorithm similar to 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

rte	the converted regexp to convert

Returns

real-time height-determinitic pushdown automaton accepting the language described by the original regular tree expression

Here is the call graph for this function:

---

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

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