Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
core::xmlApi< regexp::FormalRegExpStructure< SymbolType > > Struct Template Reference

Specialisation of the xmlApi class for formal regular expression. More...

#include <FormalRegExpStructure.h>

Static Public Member Functions

static regexp::FormalRegExpStructure< SymbolType > parse (ext::deque< sax::Token >::iterator &input)
 
static void compose (ext::deque< sax::Token > &output, const regexp::FormalRegExpStructure< SymbolType > &input)
 

Detailed Description

template<class SymbolType>
struct core::xmlApi< regexp::FormalRegExpStructure< SymbolType > >

Specialisation of the xmlApi class for formal regular expression.

The class provides the usual intarface of the xmlApi including parse and compose

Template Parameters
SymbolTypeused for the terminal alphabet

Member Function Documentation

◆ compose()

template<class SymbolType >
void core::xmlApi< regexp::FormalRegExpStructure< SymbolType > >::compose ( ext::deque< sax::Token > &  output,
const regexp::FormalRegExpStructure< SymbolType > &  input 
)
static

Composing to a sequence of xml tokens helper.

Parameters
outputthe sink for new xml tokens representing the automaton
inputthe automaton to compose
Here is the call graph for this function:

◆ parse()

template<class SymbolType >
regexp::FormalRegExpStructure< SymbolType > core::xmlApi< regexp::FormalRegExpStructure< SymbolType > >::parse ( ext::deque< sax::Token >::iterator &  input)
static

Parsing from a sequence of xml tokens helper.

\params input the iterator to sequence of xml tokens to parse from

Returns
the new instance of the regexp

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