Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
regexp::GlushkovFollow::Unbounded< SymbolType > Class Template Reference

#include <GlushkovFollow.h>

Static Public Member Functions

static ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > visit (const regexp::UnboundedRegExpAlternation< SymbolType > &node, const regexp::UnboundedRegExpSymbol< SymbolType > &symbolptr)
 
static ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > visit (const regexp::UnboundedRegExpConcatenation< SymbolType > &node, const regexp::UnboundedRegExpSymbol< SymbolType > &symbolptr)
 
static ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > visit (const regexp::UnboundedRegExpIteration< SymbolType > &node, const regexp::UnboundedRegExpSymbol< SymbolType > &symbolptr)
 
static ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > visit (const regexp::UnboundedRegExpSymbol< SymbolType > &node, const regexp::UnboundedRegExpSymbol< SymbolType > &symbFollow)
 
static ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > visit (const regexp::UnboundedRegExpEmpty< SymbolType > &node, const regexp::UnboundedRegExpSymbol< SymbolType > &symbFollow)
 
static ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > visit (const regexp::UnboundedRegExpEpsilon< SymbolType > &node, const regexp::UnboundedRegExpSymbol< SymbolType > &symbFollow)
 

Member Function Documentation

◆ visit() [1/6]

template<class SymbolType >
ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::Unbounded< SymbolType >::visit ( const regexp::UnboundedRegExpAlternation< SymbolType > &  node,
const regexp::UnboundedRegExpSymbol< SymbolType > &  symbolptr 
)
static

◆ visit() [2/6]

template<class SymbolType >
ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::Unbounded< SymbolType >::visit ( const regexp::UnboundedRegExpConcatenation< SymbolType > &  node,
const regexp::UnboundedRegExpSymbol< SymbolType > &  symbolptr 
)
static
Here is the call graph for this function:

◆ visit() [3/6]

template<class SymbolType >
ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::Unbounded< SymbolType >::visit ( const regexp::UnboundedRegExpEmpty< SymbolType > &  node,
const regexp::UnboundedRegExpSymbol< SymbolType > &  symbFollow 
)
static

◆ visit() [4/6]

template<class SymbolType >
ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::Unbounded< SymbolType >::visit ( const regexp::UnboundedRegExpEpsilon< SymbolType > &  node,
const regexp::UnboundedRegExpSymbol< SymbolType > &  symbFollow 
)
static

◆ visit() [5/6]

template<class SymbolType >
ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::Unbounded< SymbolType >::visit ( const regexp::UnboundedRegExpIteration< SymbolType > &  node,
const regexp::UnboundedRegExpSymbol< SymbolType > &  symbolptr 
)
static
Here is the call graph for this function:

◆ visit() [6/6]

template<class SymbolType >
ext::set< regexp::UnboundedRegExpSymbol< SymbolType > > regexp::GlushkovFollow::Unbounded< SymbolType >::visit ( const regexp::UnboundedRegExpSymbol< SymbolType > &  node,
const regexp::UnboundedRegExpSymbol< SymbolType > &  symbFollow 
)
static
The documentation for this class was generated from the following file:
Generated on Mon Dec 27 2021 10:22:07 for Algorithms Library Toolkit by doxygen 1.9.2