regexp::GlushkovFollow Class Reference

#include <GlushkovFollow.h>

Data Structures
class	Formal
class	Unbounded

Static Public Member Functions
template<class SymbolType >
static ext::set< UnboundedRegExpSymbol< SymbolType > >	follow (const regexp::UnboundedRegExp< SymbolType > &re, const UnboundedRegExpSymbol< SymbolType > &symbol)
template<class SymbolType >
static ext::map< regexp::FormalRegExpSymbol< SymbolType >, ext::set< regexp::FormalRegExpSymbol< SymbolType > > >	follow (const regexp::FormalRegExp< SymbolType > &re)

Detailed Description

RegExp tree traversal utils for Glushkov algorithm.

Thanks to http://www.sciencedirect.com/science/article/pii/S030439759700296X for better follow() solution.

Member Function Documentation

follow() [1/2]

template<class SymbolType >

ext::map< regexp::FormalRegExpSymbol< SymbolType >, ext::set< regexp::FormalRegExpSymbol< SymbolType > > > regexp::GlushkovFollow::follow ( const regexp::FormalRegExp< SymbolType > &  re )

static

Parameters

re	RegExp to probe
symbol	GlushkovSymbol for which we need the follow()

Returns

all symbols that can follow specific symbol in word

Here is the call graph for this function:

follow() [2/2]

template<class SymbolType >

ext::set< UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::follow ( const regexp::UnboundedRegExp< SymbolType > &  re, const UnboundedRegExpSymbol< SymbolType > &  symbol  )

static

Parameters

re	RegExp to probe
symbol	GlushkovSymbol for which we need the follow()

Returns

all symbols that can follow specific symbol in word

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:

• alib2algo/src/regexp/glushkov/GlushkovFollow.h