Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <GrammarIteration.h>
Static Public Member Functions | |
template<class TerminalSymbolType , class NonterminalSymbolType > | |
static grammar::CFG< TerminalSymbolType, NonterminalSymbolType > | iteration (const grammar::CFG< TerminalSymbolType, NonterminalSymbolType > &grammar) |
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:
|
static |