Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
rte::convert::ToFTAGlushkov Class Reference

#include <ToFTAGlushkov.h>

Static Public Member Functions

template<class SymbolType >
static automaton::NFTA< SymbolType, ext::set< common::ranked_symbol< ext::pair< SymbolType, unsigned > > > > convert (const rte::FormalRTE< SymbolType > &rte)
 

Detailed Description

Converts regular tree expression to fta

Source: adapted from Master Thesis, Pecka Tomas, CTU FIT, 2016, chapter 4.2

Member Function Documentation

◆ convert()

template<class SymbolType >
automaton::NFTA< SymbolType, ext::set< common::ranked_symbol< ext::pair< SymbolType, unsigned > > > > rte::convert::ToFTAGlushkov::convert ( const rte::FormalRTE< SymbolType > &  rte)
static

Implements conversion of the regular tree expressions to a NFTA using algorithm similar to Glushkov's method of neighbours.

Template Parameters
SymbolTypethe type of symbols in the regular expression
RankTypethe type of symbol ranks in the regular expression
Parameters
rtethe converted regexp to convert
Returns
nfta
Here is the call graph for this function:
Here is the caller graph for this function:

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