Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
IsLanguageEmpty.h
Go to the documentation of this file.
1
6#pragma once
7
9
10namespace grammar {
11
12namespace properties {
13
18public:
19 /*
20 * Decides whether L( grammar ) = \0
21 *
22 * Severals steps implemented in method @see grammar::properties::ProductiveNonterminals::getProductiveNonTerminals();
23 *
24 * \tparam T the type of the tested grammar
25 *
26 * \param grammar the tested grammar
27 *
28 * \returns true if L(@p grammar) = \0
29 */
30 template<class T>
31 static bool isLanguageEmpty( const T & grammar );
32};
33
34template<class T>
37}
38
39} /* namespace properties */
40
41} /* namespace grammar */
42
Definition: IsLanguageEmpty.h:17
static bool isLanguageEmpty(const T &grammar)
Definition: IsLanguageEmpty.h:35
static ext::set< NonterminalSymbolType > getProductiveNonterminals(const T &grammar)
Definition: ProductiveNonterminals.h:42
Definition: ToAutomaton.h:24