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

#include <NonterminalUnitRuleCycle.h>

Static Public Member Functions

template<class T , class NonterminalSymbolType >
static ext::set< NonterminalSymbolType > getNonterminalUnitRuleCycle (const T &grammar, const NonterminalSymbolType &nonterminal)
 

Detailed Description

Implements algorithms from Melichar, chapter 2.2

Member Function Documentation

◆ getNonterminalUnitRuleCycle()

template<class T , class NonterminalSymbolType >
ext::set< NonterminalSymbolType > grammar::properties::NonterminalUnitRuleCycle::getNonterminalUnitRuleCycle ( const T &  grammar,
const NonterminalSymbolType &  nonterminal 
)
static

Retrieves set N = {B : A->^* B} for given grammar and nonterminal

Source: Melichar, algorithm 2.6, step 1

Template Parameters
Tthe type of tested grammar
NonterminalSymbolTypethe type of nonterminals in the tested grammar
Parameters
grammargrammar
nonterminalnonterminal
Returns
set of nonterminals that can be derived from the given nonterminal in finite number of steps
Here is the call graph for this function:
Here is the caller graph for this function:

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