regexp::convert::ToAutomatonDerivation Class Reference

#include <ToAutomatonDerivation.h>

Static Public Member Functions
template<class T , class SymbolType = typename T::symbol_type>
static automaton::DFA< SymbolType, unsigned >	convert (const T &regexp)

Detailed Description

Converts regular expression to finite automaton using BrzozowskiDerivation algorithm (derivations of regular expressions). Source: Melichar 2.110

Member Function Documentation

convert()

template<class T , class SymbolType >

automaton::DFA< SymbolType, unsigned > regexp::convert::ToAutomatonDerivation::convert ( const T &  regexp )

static

Implements conversion of regular expressions to finite automata using Brzozowski's derivation algorithm.

Template Parameters

T	the type of regular expression to convert
SymbolType	the type of symbols in the regular expression

Parameters

regexp

the regexp to convert

Returns

finite automaton accepting the language described by the 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/ToAutomatonDerivation.h