Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages. More...

#include <UnrestrictedGrammar.h>

Inheritance diagram for grammar::UnrestrictedGrammar< SymbolType >:

Collaboration diagram for grammar::UnrestrictedGrammar< SymbolType >:

Public Member Functions
	UnrestrictedGrammar (SymbolType initialSymbol)
	Creates a new instance of the grammar with a concrete initial symbol. More...

	UnrestrictedGrammar (ext::set< SymbolType > nonterminalAlphabet, ext::set< SymbolType > terminalAlphabet, SymbolType initialSymbol)
	Creates a new instance of the grammar with a concrete nonterminal alphabet, terminal alphabet and initial symbol. More...

bool	addRule (ext::vector< SymbolType > leftHandSide, ext::vector< SymbolType > rightHandSide)
	Add a new rule of a grammar. More...

void	addRules (ext::vector< SymbolType > leftHandSide, ext::set< ext::vector< SymbolType > > rightHandSide)
	Add new rules of a grammar. More...

const ext::map< ext::vector< SymbolType >, ext::set< ext::vector< SymbolType > > > &	getRules () const &

ext::map< ext::vector< SymbolType >, ext::set< ext::vector< SymbolType > > > &&	getRules () &&

bool	removeRule (const ext::vector< SymbolType > &leftHandSide, const ext::vector< SymbolType > &rightHandSide)

const SymbolType &	getInitialSymbol () const &

SymbolType &&	getInitialSymbol () &&

bool	setInitialSymbol (SymbolType symbol)

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

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

bool	addNonterminalSymbol (SymbolType symbol)

void	setNonterminalAlphabet (ext::set< SymbolType > symbols)

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

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

bool	addTerminalSymbol (SymbolType symbol)

void	setTerminalAlphabet (ext::set< SymbolType > symbols)

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

bool	operator== (const UnrestrictedGrammar &other) const

Public Member Functions inherited from core::Components< UnrestrictedGrammar< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TerminalAlphabet, NonterminalAlphabet >, DefaultSymbolType, component::Value, InitialSymbol >
void	accessComponent ()

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

Additional Inherited Members
Static Public Member Functions inherited from core::Components< UnrestrictedGrammar< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, std::tuple< TerminalAlphabet, NonterminalAlphabet >, DefaultSymbolType, component::Value, InitialSymbol >
static void	registerComponent ()

static void	unregisterComponent ()

Detailed Description

template<class SymbolType = DefaultSymbolType>
class grammar::UnrestrictedGrammar< SymbolType >

Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages.

Definition is similar to all common definitions of unrestricted grammars. G = (N, T, P, S), N (NonterminalAlphabet) = nonempty finite set of nonterminal symbols, T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let grammar do much though, P = set of production rules of the form \alpha A \beta -> B, where A \in N, B, \alpha, and \beta \in ( N \cup T )*, S (InitialSymbol) = initial nonterminal symbol,

Template Parameters

SymbolType used for the terminal alphabet, the nonterminal alphabet, and the initial symbol of the grammar.

Constructor & Destructor Documentation

◆ UnrestrictedGrammar() [1/2]

template<class SymbolType >

grammar::UnrestrictedGrammar< SymbolType >::UnrestrictedGrammar ( SymbolType initialSymbol )

explicit

Creates a new instance of the grammar with a concrete initial symbol.

Parameters

initialSymbol the initial symbol of the grammar

◆ UnrestrictedGrammar() [2/2]

template<class SymbolType >

grammar::UnrestrictedGrammar< SymbolType >::UnrestrictedGrammar	(	ext::set< SymbolType >	nonterminalAlphabet,
		ext::set< SymbolType >	terminalAlphabet,
		SymbolType	initialSymbol
	)

explicit

Creates a new instance of the grammar with a concrete nonterminal alphabet, terminal alphabet and initial symbol.

Parameters

nonTerminalSymbols	the initial nonterminal alphabet
terminalSymbols	the initial terminal alphabet
initialSymbol	the initial symbol of the grammar

Member Function Documentation

◆ addNonterminalSymbol()

template<class SymbolType = DefaultSymbolType>

bool grammar::UnrestrictedGrammar< SymbolType >::addNonterminalSymbol ( SymbolType symbol )

inline

Adder of nonterminal symbol.

Parameters

symbol the new symbol to be added to nonterminal alphabet

Returns: true if the symbol was indeed added

◆ addRule()

template<class SymbolType >

bool grammar::UnrestrictedGrammar< SymbolType >::addRule	(	ext::vector< SymbolType >	leftHandSide,
		ext::vector< SymbolType >	rightHandSide
	)

Add a new rule of a grammar.

The rule is in a form of \alpha A \beta -> B, where A \in N, B, \alpha, and \beta \in ( N \cup T )*.

Parameters

lContext	the left context of the rule
leftHandSide	the left hand side of the rule
rContext	the right context of the rule
rightHandSide	the right hand side of the rule

Returns: true if the rule was indeed added, false othervise

Here is the call graph for this function:

◆ addRules()

template<class SymbolType >

void grammar::UnrestrictedGrammar< SymbolType >::addRules	(	ext::vector< SymbolType >	leftHandSide,
		ext::set< ext::vector< SymbolType > >	rightHandSide
	)

Add new rules of a grammar.

The rules are in form of \alpha A \beta -> B | C | ..., where A \in N, B, C ..., \alpha, and \beta \in ( N \cup T )*.

Parameters

lContext	the left context of the rule
leftHandSide	the left hand side of the rule
rContext	the right context of the rule
rightHandSide	a set of right hand sides of the rule

Here is the call graph for this function:

◆ addTerminalSymbol()

template<class SymbolType = DefaultSymbolType>

bool grammar::UnrestrictedGrammar< SymbolType >::addTerminalSymbol ( SymbolType symbol )

inline

Adder of terminal symbol.

Parameters

symbol the new symbol tuo be added to nonterminal alphabet

Returns: true if the symbol was indeed added

◆ getInitialSymbol() [1/2]

template<class SymbolType = DefaultSymbolType>

SymbolType && grammar::UnrestrictedGrammar< SymbolType >::getInitialSymbol ( ) &&

inline

Getter of initial symbol.

Returns: the initial symbol of the grammar

Here is the call graph for this function:

◆ getInitialSymbol() [2/2]

template<class SymbolType = DefaultSymbolType>

const SymbolType & grammar::UnrestrictedGrammar< SymbolType >::getInitialSymbol ( ) const &

inline

Getter of initial symbol.

Returns: the initial symbol of the grammar

Here is the caller graph for this function:

◆ getNonterminalAlphabet() [1/2]

template<class SymbolType = DefaultSymbolType>

ext::set< SymbolType > && grammar::UnrestrictedGrammar< SymbolType >::getNonterminalAlphabet ( ) &&

inline

Getter of nonterminal alphabet.

Returns: the nonterminal alphabet of the grammar

Here is the call graph for this function:

◆ getNonterminalAlphabet() [2/2]

template<class SymbolType = DefaultSymbolType>

const ext::set< SymbolType > & grammar::UnrestrictedGrammar< SymbolType >::getNonterminalAlphabet ( ) const &

inline

Getter of nonterminal alphabet.

Returns: the nonterminal alphabet of the grammar

Here is the caller graph for this function:

◆ getRules() [1/2]

template<class SymbolType = DefaultSymbolType>

ext::map< ext::vector< SymbolType >, ext::set< ext::vector< SymbolType > > > && grammar::UnrestrictedGrammar< SymbolType >::getRules ( ) &&

Get rules of the grammar.

Returns: rules of the grammar

◆ getRules() [2/2]

template<class SymbolType = DefaultSymbolType>

const ext::map< ext::vector< SymbolType >, ext::set< ext::vector< SymbolType > > > & grammar::UnrestrictedGrammar< SymbolType >::getRules ( ) const &

Get rules of the grammar.

Returns: rules of the grammar

Here is the caller graph for this function:

◆ getTerminalAlphabet() [1/2]

template<class SymbolType = DefaultSymbolType>

ext::set< SymbolType > && grammar::UnrestrictedGrammar< SymbolType >::getTerminalAlphabet ( ) &&

inline

Getter of terminal alphabet.

Returns: the terminal alphabet of the grammar

Here is the call graph for this function:

◆ getTerminalAlphabet() [2/2]

template<class SymbolType = DefaultSymbolType>

const ext::set< SymbolType > & grammar::UnrestrictedGrammar< SymbolType >::getTerminalAlphabet ( ) const &

inline

Getter of terminal alphabet.

Returns: the terminal alphabet of the grammar

Here is the caller graph for this function:

◆ operator<=>()

template<class SymbolType = DefaultSymbolType>

auto grammar::UnrestrictedGrammar< SymbolType >::operator<=> ( const UnrestrictedGrammar< 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 = DefaultSymbolType>

bool grammar::UnrestrictedGrammar< SymbolType >::operator== ( const UnrestrictedGrammar< 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:

◆ removeRule()

template<class SymbolType >

bool grammar::UnrestrictedGrammar< SymbolType >::removeRule	(	const ext::vector< SymbolType > &	leftHandSide,
		const ext::vector< SymbolType > &	rightHandSide
	)

Remove a rule of a grammar in form of \alpha A \beta -> B, where A \in N, B, \alpha, and \beta \in ( N \cup T )*.

Parameters

lContext	the left context of the rule
leftHandSide	the left hand side of the rule
rContext	the right context of the rule
rightHandSide	the right hand side of the rule

Returns: true if the rule was indeed removed, false othervise

◆ setInitialSymbol()

template<class SymbolType = DefaultSymbolType>

bool grammar::UnrestrictedGrammar< SymbolType >::setInitialSymbol ( SymbolType symbol )

inline

Setter of initial symbol.

Parameters

symbol new initial symbol of the grammar

Returns: true if the initial symbol was indeed changed

◆ setNonterminalAlphabet()

template<class SymbolType = DefaultSymbolType>

void grammar::UnrestrictedGrammar< SymbolType >::setNonterminalAlphabet ( ext::set< SymbolType > symbols )

inline

Setter of nonterminal alphabet.

Parameters

symbols completely new nonterminal alphabet

◆ setTerminalAlphabet()

template<class SymbolType = DefaultSymbolType>

void grammar::UnrestrictedGrammar< SymbolType >::setTerminalAlphabet ( ext::set< SymbolType > symbols )

inline

Setter of terminal alphabet.

Parameters

symbol completely new nontemrinal alphabet

Friends And Related Function Documentation

◆ operator<<

template<class SymbolType = DefaultSymbolType>

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

friend

Print this object as raw representation to ostream.

Parameters

out	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/grammar/Unrestricted/UnrestrictedGrammar.h

Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ UnrestrictedGrammar() [1/2]

◆ UnrestrictedGrammar() [2/2]

Member Function Documentation

◆ addNonterminalSymbol()

◆ addRule()

◆ addRules()

◆ addTerminalSymbol()

◆ getInitialSymbol() [1/2]

◆ getInitialSymbol() [2/2]

◆ getNonterminalAlphabet() [1/2]

◆ getNonterminalAlphabet() [2/2]

◆ getRules() [1/2]

◆ getRules() [2/2]

◆ getTerminalAlphabet() [1/2]

◆ getTerminalAlphabet() [2/2]

◆ operator<=>()

◆ operator==()

◆ removeRule()

◆ setInitialSymbol()

◆ setNonterminalAlphabet()

◆ setTerminalAlphabet()

Friends And Related Function Documentation

◆ operator<<