d7/dd5/ToAutomatonThompson_8h_source.html

#pragma once


#include <regexp/formal/FormalRegExp.h>

#include <regexp/formal/FormalRegExpElement.h>

#include <regexp/unbounded/UnboundedRegExp.h>

#include <regexp/unbounded/UnboundedRegExpElement.h>

#include <automaton/FSM/EpsilonNFA.h>


namespace regexp {


namespace convert {


class ToAutomatonThompson {

public:

    static automaton::EpsilonNFA < > convert(const regexp::FormalRegExp < > & regexp);


    static automaton::EpsilonNFA < > convert(const regexp::UnboundedRegExp < > & regexp);


    class Unbounded {

    public:

        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);

    };


    class Formal {

    public:

        static void visit(const regexp::FormalRegExpAlternation < DefaultSymbolType > & alternation, automaton::EpsilonNFA < > & automaton , int & nextState, const DefaultStateType * & headArg, const DefaultStateType * & tailArg);

        static void visit(const regexp::FormalRegExpConcatenation < DefaultSymbolType > & concatenation, automaton::EpsilonNFA < > & automaton , int & nextState, const DefaultStateType * & headArg, const DefaultStateType * & tailArg);

        static void visit(const regexp::FormalRegExpIteration < DefaultSymbolType > & iteration, automaton::EpsilonNFA < > & automaton , int & nextState, const DefaultStateType * & headArg, const DefaultStateType * & tailArg);

        static void visit(const regexp::FormalRegExpSymbol < DefaultSymbolType > & symbol, automaton::EpsilonNFA < > & automaton , int & nextState, const DefaultStateType * & headArg, const DefaultStateType * & tailArg);

        static void visit(const regexp::FormalRegExpEpsilon < DefaultSymbolType > & epsilon, automaton::EpsilonNFA < > & automaton , int & nextState, const DefaultStateType * & headArg, const DefaultStateType * & tailArg);

        static void visit(const regexp::FormalRegExpEmpty < DefaultSymbolType > & empty, automaton::EpsilonNFA < > & automaton , int & nextState, const DefaultStateType * & headArg, const DefaultStateType * & tailArg);

    };


};


} /* namespace convert */


} /* namespace regexp */


FormalRegExpElement.h

UnboundedRegExpElement.h

EpsilonNFA.h

FormalRegExp.h

UnboundedRegExp.h

automaton::EpsilonNFA
Epsilon nondeterministic finite automaton. Accepts regular languages.
Definition: EpsilonNFA.h:74

object::Object
Definition: Object.h:16

regexp::FormalRegExpAlternation
Represents the alternation operator in the regular expression. The node must have exactly two childre...
Definition: FormalRegExpAlternation.h:44

regexp::FormalRegExpConcatenation
Represents the concatenation operator in the regular expression. The node must have exactly two child...
Definition: FormalRegExpConcatenation.h:44

regexp::FormalRegExpEmpty
Represents the empty expression in the regular expression. The node can't have any children.
Definition: FormalRegExpEmpty.h:41

regexp::FormalRegExpEpsilon
Represents the epsilon expression in the regular expression. The node can't have any children.
Definition: FormalRegExpEpsilon.h:41

regexp::FormalRegExpIteration
Represents the iteration operator in the regular expression. The node has exactly one child.
Definition: FormalRegExpIteration.h:44

regexp::FormalRegExpSymbol
Represents the symbol in the regular expression. The can't have any children.
Definition: FormalRegExpSymbol.h:42

regexp::FormalRegExp
Formal regular expression represents regular expression. It describes regular languages....
Definition: FormalRegExp.h:78

regexp::UnboundedRegExpAlternation
Represents the alternation operator in the regular expression. The node can have 0 to n children in l...
Definition: UnboundedRegExpAlternation.h:44

regexp::UnboundedRegExpConcatenation
Represents the concatenation operator in the regular expression. The node can have 0 to n children in...
Definition: UnboundedRegExpConcatenation.h:44

regexp::UnboundedRegExpEmpty
Represents the empty expression in the regular expression. The node can't have any children.
Definition: UnboundedRegExpEmpty.h:41

regexp::UnboundedRegExpEpsilon
Represents the epsilon expression in the regular expression. The node can't have any children.
Definition: UnboundedRegExpEpsilon.h:41

regexp::UnboundedRegExpIteration
Represents the iteration operator in the regular expression. The node has exactly one child.
Definition: UnboundedRegExpIteration.h:43

regexp::UnboundedRegExpSymbol
Represents the symbol in the regular expression. The can't have any children.
Definition: UnboundedRegExpSymbol.h:42

regexp::UnboundedRegExp
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80

regexp::convert::ToAutomatonThompson::Formal
Definition: ToAutomatonThompson.h:54

regexp::convert::ToAutomatonThompson::Formal::visit
static void visit(const regexp::FormalRegExpAlternation< DefaultSymbolType > &alternation, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
Definition: ToAutomatonThompson.cpp:53

regexp::convert::ToAutomatonThompson::Unbounded
Definition: ToAutomatonThompson.h:44

regexp::convert::ToAutomatonThompson::Unbounded::visit
static void visit(const regexp::UnboundedRegExpAlternation< DefaultSymbolType > &alternation, automaton::EpsilonNFA< > &automaton, int &nextState, const DefaultStateType *&headArg, const DefaultStateType *&tailArg)
Definition: ToAutomatonThompson.cpp:133

regexp::convert::ToAutomatonThompson
Definition: ToAutomatonThompson.h:26

regexp::convert::ToAutomatonThompson::convert
static automaton::EpsilonNFA< > convert(const regexp::FormalRegExp< > &regexp)
Definition: ToAutomatonThompson.cpp:13

automaton
Definition: ToGrammar.h:31

convert
Definition: converterCommon.hpp:8

regexp
Definition: ToAutomaton.h:15