regexp::convert::ToGrammarRightRGGlushkov Class Reference

#include <ToGrammarRightRGGlushkov.h>

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

Detailed Description

Converts regular expression to right regular grammar using Glushkov algorithm of neighbours. Source: None yet.

Member Function Documentation

convert() [1/2]

template<class SymbolType >

grammar::RightRG< SymbolType, ext::pair< SymbolType, unsigned > > regexp::convert::ToGrammarRightRGGlushkov::convert ( const regexp::FormalRegExp< SymbolType > &  regexp )

static

Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours.

Template Parameters

SymbolType

the type of symbols in the regular expression

Parameters

regexp

the regexp to convert

Returns

right regular grammar generating the language described by the original regular expression

Here is the call graph for this function:

Here is the caller graph for this function:

convert() [2/2]

template<class SymbolType >

grammar::RightRG< SymbolType, ext::pair< SymbolType, unsigned > > regexp::convert::ToGrammarRightRGGlushkov::convert ( const regexp::UnboundedRegExp< SymbolType > &  regexp )

static

\override

Here is the call graph for this function:

---

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

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