Unbounded regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes: More...

#include <UnboundedRegExp.h>

Inheritance diagram for regexp::UnboundedRegExp< SymbolType >:

[legend]

Collaboration diagram for regexp::UnboundedRegExp< SymbolType >:

[legend]

Public Types
using	symbol_type = SymbolType

Public Member Functions
	UnboundedRegExp ()
	Creates a new instance of the expression. The default constructor creates expression describing empty language. More...

	UnboundedRegExp (ext::set< SymbolType > alphabet, UnboundedRegExpStructure< SymbolType > regExp)
	Creates a new instance of the expression with a concrete alphabet and initial content. More...

	UnboundedRegExp (UnboundedRegExpStructure< SymbolType > regExp)
	Creates a new instance of the expression based on initial content. The alphabet is derived from the content. More...

	UnboundedRegExp (const FormalRegExp< SymbolType > &other)
	Created a new instance of the expression based on the FormalRegExp representation. More...

const ext::set< SymbolType > &	getAlphabet () const &

ext::set< SymbolType > &&	getAlphabet () &&

const UnboundedRegExpStructure< SymbolType > &	getRegExp () const &

UnboundedRegExpStructure< SymbolType > &&	getRegExp () &&

void	setRegExp (UnboundedRegExpStructure< SymbolType > param)

auto	operator<=> (const UnboundedRegExp &other) const

bool	operator== (const UnboundedRegExp &other) const

Public Member Functions inherited from core::Components< UnboundedRegExp< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet >
void	accessComponent ()

Friends
ext::ostream &	operator<< (ext::ostream &out, const UnboundedRegExp &instance)

Additional Inherited Members
Static Public Member Functions inherited from core::Components< UnboundedRegExp< SymbolType >, ext::set< SymbolType >, component::Set, GeneralAlphabet >
static void	registerComponent ()

static void	unregisterComponent ()

Detailed Description

template<class SymbolType>
class regexp::UnboundedRegExp< SymbolType >

Unbounded regular expression represents regular expression. It describes regular languages. The expression consists of the following nodes:

Alternation - the representation of + in the regular expression
Concatenation - the representation of ⋅ in the regular expression
Iteration - the representation of * (Kleene star)
Epsilon - the representation of empty word
Empty - the representation of empty regular expression
Symbol - the representation of single symbol

The unbounded representation allows nodes of concatenation and alternation to have any number of children.

Alternation of nothing is equivalent to empty regular expression. Concatenation of nothing is equivalent to empty word.

The structure of the regular expression is wrapped in a structure class to allow separate the alphabet from the structure for example in Extended NFA

Definition is unbounded definition of regular expressions. E = (T, C), T (Alphabet) = finite set of terminal symbols C (Content) = representation of the regular expression

Template Parameters

SymbolType used for the terminal alphabet

Member Typedef Documentation

◆ symbol_type

template<class SymbolType >

using regexp::UnboundedRegExp< SymbolType >::symbol_type = SymbolType

The exposed SymbolType template parameter.

Constructor & Destructor Documentation

◆ UnboundedRegExp() [1/4]

template<class SymbolType >

regexp::UnboundedRegExp< SymbolType >::UnboundedRegExp

explicit

Creates a new instance of the expression. The default constructor creates expression describing empty language.

◆ UnboundedRegExp() [2/4]

template<class SymbolType >

regexp::UnboundedRegExp< SymbolType >::UnboundedRegExp	(	ext::set< SymbolType >	alphabet,
		UnboundedRegExpStructure< SymbolType >	regExp
	)

explicit

Creates a new instance of the expression with a concrete alphabet and initial content.

Parameters

alphabet	the initial input alphabet
regExp	the initial regexp content

◆ UnboundedRegExp() [3/4]

template<class SymbolType >

regexp::UnboundedRegExp< SymbolType >::UnboundedRegExp ( UnboundedRegExpStructure< SymbolType > regExp )

explicit

Creates a new instance of the expression based on initial content. The alphabet is derived from the content.

Parameters

regExp the initial regexp content

◆ UnboundedRegExp() [4/4]

template<class SymbolType >

regexp::UnboundedRegExp< SymbolType >::UnboundedRegExp ( const FormalRegExp< SymbolType > & other )

explicit

Created a new instance of the expression based on the FormalRegExp representation.

Member Function Documentation

◆ getAlphabet() [1/2]

template<class SymbolType >

ext::set< SymbolType > && regexp::UnboundedRegExp< SymbolType >::getAlphabet ( ) &&

inline

Getter of the alphabet.

Returns: the alphabet of the expression

Here is the call graph for this function:

◆ getAlphabet() [2/2]

template<class SymbolType >

const ext::set< SymbolType > & regexp::UnboundedRegExp< SymbolType >::getAlphabet ( ) const &

inline

Getter of the alphabet.

Returns: the alphabet of the expression

Here is the caller graph for this function:

◆ getRegExp() [1/2]

template<class SymbolType >

UnboundedRegExpStructure< SymbolType > && regexp::UnboundedRegExp< SymbolType >::getRegExp ( ) &&

Get the structure of the expression.

Returns: the structure of the expression.

◆ getRegExp() [2/2]

template<class SymbolType >

const UnboundedRegExpStructure< SymbolType > & regexp::UnboundedRegExp< SymbolType >::getRegExp ( ) const &

Get the structure of the expression.

Returns: the structure of the expression.

Here is the caller graph for this function:

◆ operator<=>()

template<class SymbolType >

auto regexp::UnboundedRegExp< SymbolType >::operator<=> ( const UnboundedRegExp< SymbolType > & other ) const

inline

The three way comparison implementation

Parameters

other the other instance

Returns: the ordering between this object and the other.

Here is the call graph for this function:

◆ operator==()

template<class SymbolType >

bool regexp::UnboundedRegExp< SymbolType >::operator== ( const UnboundedRegExp< SymbolType > & other ) const

inline

The equality comparison implementation.

Parameters

other the other object to compare with.

Returns: true if this and other objects are equal, false othervise

Here is the call graph for this function:

◆ setRegExp()

template<class SymbolType >

void regexp::UnboundedRegExp< SymbolType >::setRegExp ( UnboundedRegExpStructure< SymbolType > param )

Set the structure of the expression.

Parameters

regExp the new structure of the expression.

Friends And Related Function Documentation

◆ operator<<

template<class SymbolType >

ext::ostream & operator<<	(	ext::ostream &	out,
		const UnboundedRegExp< SymbolType > &	instance
	)

friend

Print this object as raw representation to ostream.

Parameters

os	ostream where to print
instance	object to print

Returns: modified output stream

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

alib2data/src/regexp/unbounded/UnboundedRegExp.h

Public Types

Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ symbol_type

Constructor & Destructor Documentation

◆ UnboundedRegExp() [1/4]

◆ UnboundedRegExp() [2/4]

◆ UnboundedRegExp() [3/4]

◆ UnboundedRegExp() [4/4]

Member Function Documentation

◆ getAlphabet() [1/2]

◆ getAlphabet() [2/2]

◆ getRegExp() [1/2]

◆ getRegExp() [2/2]

◆ operator<=>()

◆ operator==()

◆ setRegExp()

Friends And Related Function Documentation

◆ operator<<