Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#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) |
Converts regular tree expression to fta
Source: adapted from Master Thesis, Pecka Tomas, CTU FIT, 2016, chapter 4.2
|
static |
Implements conversion of the regular tree expressions to a NFTA using algorithm similar to Glushkov's method of neighbours.
SymbolType | the type of symbols in the regular expression |
RankType | the type of symbol ranks in the regular expression |
rte | the converted regexp to convert |