regexp::GlushkovFirst Class Reference

#include <GlushkovFirst.h>

Data Structures
class	Formal
class	Unbounded

Static Public Member Functions
template<class SymbolType >
static ext::set< UnboundedRegExpSymbol< SymbolType > >	first (const regexp::UnboundedRegExp< SymbolType > &re)
template<class SymbolType >
static ext::set< FormalRegExpSymbol< SymbolType > >	first (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

first() [1/2]

template<class SymbolType >

ext::set< FormalRegExpSymbol< SymbolType > > regexp::GlushkovFirst::first ( const regexp::FormalRegExp< SymbolType > &  re )

static

Parameters

re	RegExp to probe

Returns

all RegExpSymbols whichcan start the word.

Here is the call graph for this function:

first() [2/2]

template<class SymbolType >

ext::set< UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFirst::first ( const regexp::UnboundedRegExp< SymbolType > &  re )

static

Parameters

re	RegExp to probe

Returns

all RegExpSymbols whichcan start the 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/GlushkovFirst.h