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

#include <ToAutomatonTopDown.h>

Static Public Member Functions

template<class T , class TerminalSymbolType = typename grammar::TerminalSymbolTypeOfGrammar < T >, class NonterminalSymbolType = typename grammar::NonterminalSymbolTypeOfGrammar < T >>
static automaton::NPDA< TerminalSymbolType, ext::variant< TerminalSymbolType, NonterminalSymbolType >, unsigned > convert (const T &grammar)
 

Member Function Documentation

◆ convert()

template<class T , class TerminalSymbolType , class NonterminalSymbolType >
automaton::NPDA< TerminalSymbolType, ext::variant< TerminalSymbolType, NonterminalSymbolType >, unsigned > grammar::convert::ToAutomatonTopDown::convert ( const T &  grammar)
static

Converts a context free grammar to a pushdown automaton by method of bottom up analysis.

Template Parameters
Tthe type of converted grammar
TerminalSymbolTypethe type of terminals in the converted grammar
NonterminalSymbolTypethe type of nonterminals in the converted grammar
Parameters
grammarthe converted context free grammar
Returns
pushdown automaton accepting the language generated by grammar
Here is the caller graph for this function:

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