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

#include <GrammarIteration.h>

Static Public Member Functions

template<class TerminalSymbolType , class NonterminalSymbolType >
static grammar::CFG< TerminalSymbolType, NonterminalSymbolType > iteration (const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &grammar)
 

Detailed Description

Iteration 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

◆ iteration()

template<class TerminalSymbolType , class NonterminalSymbolType >
grammar::CFG< TerminalSymbolType, NonterminalSymbolType > grammar::transform::GrammarIteration::iteration ( const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &  grammar)
static

Iterates a grammar.

Template Parameters
TerminalSymbolTypeType for terminal symbols.
NonterminalSymbolTypeType for nonterminal symbols.
Parameters
grammargrammar
Returns
CFG grammar for iteartion of a CFG grammar
Here is the call graph for this function:

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