rte::convert::ToFTAThompson Class Reference

#include <ToFTAThompson.h>

Data Structures
class	Formal

Static Public Member Functions
template<class SymbolType >
static automaton::EpsilonNFTA< SymbolType, unsigned >	convert (const rte::FormalRTE< SymbolType > &rte)

Detailed Description

Converts regular tree expression to fta

Source: adapted from Extended Path Expressions for XML, Makoto Murata, 2001, Lemma 1, and Master Thesis, Polach Radomir, CTU FIT, 2011

Member Function Documentation

convert()

template<class SymbolType >

static automaton::EpsilonNFTA< SymbolType, unsigned > rte::convert::ToFTAThompson::convert ( const rte::FormalRTE< SymbolType > &  rte )

inlinestatic

Implements conversion of the regular tree expressions to a EpsilonNFTA using algorithm similar to Thompson's method of incremental construction.

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

epsilon nfta accepting the language described by the regular tree expression

---

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

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