Left regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages. More...

#include <LeftRG.h>

Inheritance diagram for grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >:

Collaboration diagram for grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >:

Public Member Functions
	LeftRG (NonterminalSymbolType initialSymbol)
	Creates a new instance of Left regular grammar with a concrete initial symbol. More...

	LeftRG (ext::set< NonterminalSymbolType > nonterminalAlphabet, ext::set< TerminalSymbolType > terminalAlphabet, NonterminalSymbolType initialSymbol)
	Creates a new instance of Left regular grammar with a concrete nonterminal, terminal alphabet and initial symbol. More...

bool	addRule (NonterminalSymbolType leftHandSide, ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > rightHandSide)
	Add a new rule of a grammar. More...

void	addRules (NonterminalSymbolType leftHandSide, ext::set< ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > > rightHandSide)
	Add new rules of a grammar. More...

const ext::map< NonterminalSymbolType, ext::set< ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > > > &	getRules () const &

ext::map< NonterminalSymbolType, ext::set< ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > > > &&	getRules () &&

bool	removeRule (const NonterminalSymbolType &leftHandSide, const ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > &rightHandSide)

bool	removeRule (const NonterminalSymbolType &leftHandSide, const TerminalSymbolType &rightHandSide)

bool	removeRule (const NonterminalSymbolType &leftHandSide, const ext::pair< NonterminalSymbolType, TerminalSymbolType > &rightHandSide)

const NonterminalSymbolType &	getInitialSymbol () const &

NonterminalSymbolType &&	getInitialSymbol () &&

bool	setInitialSymbol (NonterminalSymbolType symbol)

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

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

bool	addNonterminalSymbol (NonterminalSymbolType symbol)

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

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

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

bool	addTerminalSymbol (TerminalSymbolType symbol)

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

void	setGeneratesEpsilon (bool genEps)

bool	getGeneratesEpsilon () const

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

bool	operator== (const LeftRG &other) const

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

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

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

static void	unregisterComponent ()

Detailed Description

template<class TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>
class grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >

Left regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages.

Definition is similar to all common definitions of regular grammars. Additionaly contains boolean signaling whether the grammar generates empty string or don't. Hence the A -> \eps and not even S -> \eps, where A \in N is not allowed. G = (N, T, P, S, E), 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 -> Ba or A -> a, where A, B \in N and a \in T, S (InitialSymbol) = initial nonterminal symbol, E = boolean signaling wheter grammar generates empty string or don't.

This definition has simplier handling of empty string generation and it is compatible with common definitions where the transformation from this definition to the common definition and backwards is straightforward.

Template Parameters

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

Constructor & Destructor Documentation

◆ LeftRG() [1/2]

template<class TerminalSymbolType , class NonterminalSymbolType >

grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::LeftRG ( NonterminalSymbolType initialSymbol )

explicit

Creates a new instance of Left regular grammar with a concrete initial symbol.

Parameters

initialSymbol the initial symbol of the grammar

◆ LeftRG() [2/2]

template<class TerminalSymbolType , class NonterminalSymbolType >

grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::LeftRG	(	ext::set< NonterminalSymbolType >	nonterminalAlphabet,
		ext::set< TerminalSymbolType >	terminalAlphabet,
		NonterminalSymbolType	initialSymbol
	)

explicit

Creates a new instance of Left regular grammar with a concrete nonterminal, 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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::addNonterminalSymbol ( NonterminalSymbolType 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

Here is the caller graph for this function:

◆ addRule()

template<class TerminalSymbolType , class NonterminalSymbolType >

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::addRule	(	NonterminalSymbolType	leftHandSide,
		ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > >	rightHandSide
	)

Add a new rule of a grammar.

The rule is in a form of A -> Ba or A -> a, where A, B \in N and a \in T.

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 caller graph for this function:

◆ addRules()

template<class TerminalSymbolType , class NonterminalSymbolType >

void grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::addRules	(	NonterminalSymbolType	leftHandSide,
		ext::set< ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > >	rightHandSide
	)

Add new rules of a grammar.

The rules are in form of A -> Ba | Cb | ... | a | b | ..., where A, B, C ... \in N and a, b ... \in T.

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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::addTerminalSymbol ( TerminalSymbolType 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 TerminalSymbolType , class NonterminalSymbolType >

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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

Here is the caller graph for this function:

◆ getInitialSymbol() [1/2]

template<class TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

NonterminalSymbolType && grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

const NonterminalSymbolType & grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

ext::set< NonterminalSymbolType > && grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

const ext::set< NonterminalSymbolType > & grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

ext::map< NonterminalSymbolType, ext::set< ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > > > && grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::getRules ( ) &&

Get rules of the grammar.

Returns: rules of the grammar

◆ getRules() [2/2]

template<class TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

const ext::map< NonterminalSymbolType, ext::set< ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > > > & grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

ext::set< TerminalSymbolType > && grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

const ext::set< TerminalSymbolType > & grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

auto grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::operator<=> ( const LeftRG< TerminalSymbolType, NonterminalSymbolType > & 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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::operator== ( const LeftRG< TerminalSymbolType, NonterminalSymbolType > & 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() [1/3]

template<class TerminalSymbolType , class NonterminalSymbolType >

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::removeRule	(	const NonterminalSymbolType &	leftHandSide,
		const ext::pair< NonterminalSymbolType, TerminalSymbolType > &	rightHandSide
	)

Remove a rule of a grammar in form of A -> Ba, where A, B \in N and a \in T.

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

◆ removeRule() [2/3]

template<class TerminalSymbolType , class NonterminalSymbolType >

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::removeRule	(	const NonterminalSymbolType &	leftHandSide,
		const ext::variant< TerminalSymbolType, ext::pair< NonterminalSymbolType, TerminalSymbolType > > &	rightHandSide
	)

Remove a rule of a grammar in form of A -> Ba or A -> a, where A, B \in N and a \in T.

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

◆ removeRule() [3/3]

template<class TerminalSymbolType , class NonterminalSymbolType >

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::removeRule	(	const NonterminalSymbolType &	leftHandSide,
		const TerminalSymbolType &	rightHandSide
	)

Remove a rule of a grammar in form of A -> a, where A \in N and a \in T.

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 TerminalSymbolType , class NonterminalSymbolType >

void grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::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

Here is the caller graph for this function:

◆ setInitialSymbol()

template<class TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

bool grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::setInitialSymbol ( NonterminalSymbolType 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 TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

void grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::setNonterminalAlphabet ( ext::set< NonterminalSymbolType > symbols )

inline

Setter of nonterminal alphabet.

Parameters

symbols completely new nonterminal alphabet

◆ setTerminalAlphabet()

template<class TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

void grammar::LeftRG< TerminalSymbolType, NonterminalSymbolType >::setTerminalAlphabet ( ext::set< TerminalSymbolType > symbols )

inline

Setter of terminal alphabet.

Parameters

symbol completely new nontemrinal alphabet

Here is the caller graph for this function:

Friends And Related Function Documentation

◆ operator<<

template<class TerminalSymbolType = DefaultSymbolType, class NonterminalSymbolType = DefaultSymbolType>

ext::ostream & operator<<	(	ext::ostream &	out,
		const LeftRG< TerminalSymbolType, NonterminalSymbolType > &	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/Regular/LeftRG.h

Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ LeftRG() [1/2]

◆ LeftRG() [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() [1/3]

◆ removeRule() [2/3]

◆ removeRule() [3/3]

◆ setGeneratesEpsilon()

◆ setInitialSymbol()

◆ setNonterminalAlphabet()

◆ setTerminalAlphabet()

Friends And Related Function Documentation

◆ operator<<