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

#include <ToAutomatonThompson.h>

Static Public Member Functions

static void visit (const regexp::UnboundedRegExpAlternation< DefaultSymbolType > &alternation, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
 
static void visit (const regexp::UnboundedRegExpConcatenation< DefaultSymbolType > &concatenation, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
 
static void visit (const regexp::UnboundedRegExpIteration< DefaultSymbolType > &iteration, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
 
static void visit (const regexp::UnboundedRegExpSymbol< DefaultSymbolType > &symbol, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
 
static void visit (const regexp::UnboundedRegExpEpsilon< DefaultSymbolType > &epsilon, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
 
static void visit (const regexp::UnboundedRegExpEmpty< DefaultSymbolType > &empty, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
 

Member Function Documentation

◆ visit() [1/6]

void regexp::convert::ToAutomatonThompson::Unbounded::visit ( const regexp::UnboundedRegExpAlternation< DefaultSymbolType > &  alternation,
automaton::EpsilonNFA< > &  automaton,
int &  nextState,
const DefaultStateType *&  headArg,
const DefaultStateType *&  tailArg 
)
static
Here is the call graph for this function:

◆ visit() [2/6]

void regexp::convert::ToAutomatonThompson::Unbounded::visit ( const regexp::UnboundedRegExpConcatenation< DefaultSymbolType > &  concatenation,
automaton::EpsilonNFA< > &  automaton,
int &  nextState,
const DefaultStateType *&  headArg,
const DefaultStateType *&  tailArg 
)
static
Here is the call graph for this function:

◆ visit() [3/6]

void regexp::convert::ToAutomatonThompson::Unbounded::visit ( const regexp::UnboundedRegExpEmpty< DefaultSymbolType > &  empty,
automaton::EpsilonNFA< > &  automaton,
int &  nextState,
const DefaultStateType *&  headArg,
const DefaultStateType *&  tailArg 
)
static

◆ visit() [4/6]

void regexp::convert::ToAutomatonThompson::Unbounded::visit ( const regexp::UnboundedRegExpEpsilon< DefaultSymbolType > &  epsilon,
automaton::EpsilonNFA< > &  automaton,
int &  nextState,
const DefaultStateType *&  headArg,
const DefaultStateType *&  tailArg 
)
static

◆ visit() [5/6]

void regexp::convert::ToAutomatonThompson::Unbounded::visit ( const regexp::UnboundedRegExpIteration< DefaultSymbolType > &  iteration,
automaton::EpsilonNFA< > &  automaton,
int &  nextState,
const DefaultStateType *&  headArg,
const DefaultStateType *&  tailArg 
)
static
Here is the call graph for this function:

◆ visit() [6/6]

void regexp::convert::ToAutomatonThompson::Unbounded::visit ( const regexp::UnboundedRegExpSymbol< DefaultSymbolType > &  symbol,
automaton::EpsilonNFA< > &  automaton,
int &  nextState,
const DefaultStateType *&  headArg,
const DefaultStateType *&  tailArg 
)
static
Here is the call graph for this function:

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