regexp::convert::ToAutomaton Class Reference

#include <ToAutomaton.h>

Static Public Member Functions
template<class SymbolType >
static automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > >	convert (const regexp::FormalRegExp< SymbolType > &regexp)
template<class SymbolType >
static automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > >	convert (const regexp::UnboundedRegExp< SymbolType > &regexp)

Detailed Description

Conversion of regular expression to finite automata. This class serves as a "default wrapper" over the conversion of RE to FA. It delegates to the glushkov conversion algorithm.

See also

regexp::convert::ToGlushkovAutomaton

Member Function Documentation

convert() [1/2]

template<class SymbolType >

automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > > regexp::convert::ToAutomaton::convert ( const regexp::FormalRegExp< SymbolType > &  regexp )

static

Converts the regular expression into an automaton (

See also

regexp::convert::ToGlushkovAutomaton::convert).

Template Parameters

SymbolType

the type of regular expression

Parameters

regexp

the regular expression

Returns

finite automaton equivalent to original regular expression

Here is the call graph for this function:

convert() [2/2]

template<class SymbolType >

automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > > regexp::convert::ToAutomaton::convert ( const regexp::UnboundedRegExp< SymbolType > &  regexp )

static

Converts the regular expression into an automaton (

See also

regexp::convert::ToGlushkovAutomaton::convert).

Template Parameters

SymbolType

the type of regular expression

Parameters

regexp

the regular expression

Returns

finite automaton equivalent to original regular expression

Here is the call graph for this function:

---

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

• alib2algo/src/regexp/convert/ToAutomaton.h