Noncontracting grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages. More...

#include <NonContractingGrammar.h>

Inheritance diagram for grammar::NonContractingGrammar< SymbolType >:

[legend]

Collaboration diagram for grammar::NonContractingGrammar< SymbolType >:

[legend]

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

	NonContractingGrammar (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)

void	setGeneratesEpsilon (bool genEps)

bool	getGeneratesEpsilon () const

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

bool	operator== (const NonContractingGrammar &other) const

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

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

Additional Inherited Members
Static Public Member Functions inherited from core::Components< NonContractingGrammar< 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::NonContractingGrammar< SymbolType >

Noncontracting grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages.

Definition is similar to all common definitions of context sensitive 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 A -> B, where A, B \in ( N \cup T )+ and |A| <= |B|, 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

◆ NonContractingGrammar() [1/2]

template<class SymbolType >

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

explicit

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

Parameters

initialSymbol the initial symbol of the grammar

◆ NonContractingGrammar() [2/2]

template<class SymbolType >

grammar::NonContractingGrammar< SymbolType >::NonContractingGrammar	(	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::NonContractingGrammar< 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::NonContractingGrammar< SymbolType >::addRule	(	ext::vector< SymbolType >	leftHandSide,
		ext::vector< SymbolType >	rightHandSide
	)

Add a new rule of a grammar.

The rule is in a form of A -> B, where A, B \in ( N \cup T )+, and |A| <= |B|.

Parameters

leftHandSide	the left hand side 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::NonContractingGrammar< SymbolType >::addRules	(	ext::vector< SymbolType >	leftHandSide,
		ext::set< ext::vector< SymbolType > >	rightHandSide
	)

Add new rules of a grammar.

The rules are in form of A -> B | C | ..., where A, B, C ... \in ( N \cup T )+, and |A| <= |B|.

Parameters

leftHandSide	the left hand side 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::NonContractingGrammar< 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

◆ getGeneratesEpsilon()

template<class SymbolType >

bool grammar::NonContractingGrammar< SymbolType >::getGeneratesEpsilon

Gets sign representing that grammar generates or doesn't generate empty word.

Returns: sign representing the posibility of generating empty string from the grammar

◆ getInitialSymbol() [1/2]

template<class SymbolType = DefaultSymbolType>

SymbolType && grammar::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< 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::NonContractingGrammar< SymbolType >::operator<=> ( const NonContractingGrammar< 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::NonContractingGrammar< SymbolType >::operator== ( const NonContractingGrammar< 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::NonContractingGrammar< SymbolType >::removeRule	(	const ext::vector< SymbolType > &	leftHandSide,
		const ext::vector< SymbolType > &	rightHandSide
	)

Remove a rule of a grammar in form of A -> B, where A, B \in ( N \cup T )+, and |A| <= |B|.

Parameters

leftHandSide	the left hand side of the rule
rightHandSide	the right hand side of the rule

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

◆ setGeneratesEpsilon()

template<class SymbolType >

void grammar::NonContractingGrammar< SymbolType >::setGeneratesEpsilon ( bool genEps )

Sets sign representing that grammar generates or doesn't generate empty word.

Parameters

genEps sign representing the posibility of generating empty string from the grammar

◆ setInitialSymbol()

template<class SymbolType = DefaultSymbolType>

bool grammar::NonContractingGrammar< 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::NonContractingGrammar< SymbolType >::setNonterminalAlphabet ( ext::set< SymbolType > symbols )

inline

Setter of nonterminal alphabet.

Parameters

symbols completely new nonterminal alphabet

◆ setTerminalAlphabet()

template<class SymbolType = DefaultSymbolType>

void grammar::NonContractingGrammar< 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 NonContractingGrammar< 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/ContextSensitive/NonContractingGrammar.h

Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ NonContractingGrammar() [1/2]

◆ NonContractingGrammar() [2/2]

Member Function Documentation

◆ addNonterminalSymbol()

◆ addRule()

◆ addRules()

◆ addTerminalSymbol()

◆ getGeneratesEpsilon()

◆ 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()

◆ setGeneratesEpsilon()

◆ setInitialSymbol()

◆ setNonterminalAlphabet()

◆ setTerminalAlphabet()

Friends And Related Function Documentation

◆ operator<<