Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
grammar::transform::GrammarAlternation Class Reference

#include <GrammarAlternation.h>

Static Public Member Functions

template<class TerminalSymbolType , class NonterminalSymbolType >
static grammar::CFG< TerminalSymbolType, ext::pair< NonterminalSymbolType, unsigned > > alternation (const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &first, const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &second)
 

Detailed Description

Alternation of two grammars. For two regular grammars G1 and G2, we create a regular grammar such that L(G) = L(G1) \cup L(G2). For CFG and CFG/RG we create a context free grammar such that L(G) = L(G1) \cup L(G2). Source:

Member Function Documentation

◆ alternation()

template<class TerminalSymbolType , class NonterminalSymbolType >
grammar::CFG< TerminalSymbolType, ext::pair< NonterminalSymbolType, unsigned > > grammar::transform::GrammarAlternation::alternation ( const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &  first,
const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &  second 
)
static

Alternates two grammars.

Template Parameters
TerminalSymbolTypeType for terminal symbols.
NonterminalSymbolTypeType for nonterminal symbols.
Parameters
firstFirst grammar (G1)
secondSecond grammar (G2)
Returns
CFG grammar for alternation of two CFG or RightRG for alternation of two RightRG.
Here is the call graph for this function:

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