grammar Namespace Reference

Namespaces
namespace	convert
namespace	generate
namespace	parsing
namespace	properties
namespace	simplify
namespace	transform

Data Structures
class	AddRawRule
class	CFG
	Context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages. More...
class	CNF
	Chomsky normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages. More...
class	ContextPreservingUnrestrictedGrammar
	Context preserving unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages. More...
class	CSG
	Context sensitive grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages. More...
class	EpsilonFreeCFG
	Context free grammar without epsilon rules in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages. More...
class	GNF
	Greibach normal form of a context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages. More...
class	GrammarException
class	GrammarFromStringLexer
class	GrammarFromStringParserCommon
class	GrammarFromXMLParser
class	GrammarNormalize
class	GrammarToStringComposerCommon
class	GrammarToXMLComposer
class	LeftLG
	Left linear grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages. More...
class	LeftRG
	Left regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages. More...
class	LG
	Context free grammar in Chomsky hierarchy or type 2 in Chomsky hierarchy. Generates context free languages. More...
class	NonContractingGrammar
	Noncontracting grammar in Chomsky hierarchy or type 1 in Chomsky hierarchy. Generates context sensitive languages. More...
class	RawRules
class	RightLG
	Right linear grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages. More...
class	RightRG
	Right regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular languages. More...
class	UnrestrictedGrammar
	Unrestricted grammar. Type 0 in Chomsky hierarchy. Generates recursively enumerable languages. More...

Typedefs
template<class T >
using	TerminalSymbolTypeOfGrammar = typename std::decay< decltype(std::declval< T >().getTerminalAlphabet()) >::type::value_type
template<class T >
using	NonterminalSymbolTypeOfGrammar = typename std::decay< decltype(std::declval< T >().getNonterminalAlphabet()) >::type::value_type

Typedef Documentation

NonterminalSymbolTypeOfGrammar

template<class T >

using grammar::NonterminalSymbolTypeOfGrammar = typedef typename std::decay < decltype (std::declval<T>().getNonterminalAlphabet()) >::type::value_type

TerminalSymbolTypeOfGrammar

template<class T >

using grammar::TerminalSymbolTypeOfGrammar = typedef typename std::decay < decltype (std::declval<T>().getTerminalAlphabet()) >::type::value_type