Documentation
¶
Index ¶
- func ConstructGraph(inputArr []input_struct.EdgeInput) *ds.AdjGraph
- func GenerateSubSets(faGraph *ds.AdjGraph, nodes []interface{}) *ds.MySet
- func MinDFA(nfa *ds.AdjGraph, startNodes []interface{}) *ds.AdjGraph
- func NFAGenerateSubsetsAndConstructDFA(nfaGraph *ds.AdjGraph, startNodes []interface{}) (*ds.MySet, *ds.AdjGraph)
- func NFAToDFA(nfa *ds.AdjGraph, startNodes []interface{}) *ds.AdjGraph
- func NFAToRegex(faGraph *ds.AdjGraph) string
- func NodeSetToIntValueSet(I *ISet) *ds.MySet
- func RegexToNFA(regex string) *ds.AdjGraph
- func SubSetByOrder(C *ds.MySet) *ds.MySet
- type DFA
- type DFATable
- type IFA
- type ISet
- type NFA
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func ConstructGraph ¶
func ConstructGraph(inputArr []input_struct.EdgeInput) *ds.AdjGraph
func GenerateSubSets ¶
GenerateSubSets C is union of all subsets 求子集依赖于底层的GraphAPI提供支持
func NFAGenerateSubsetsAndConstructDFA ¶
func NFAGenerateSubsetsAndConstructDFA(nfaGraph *ds.AdjGraph, startNodes []interface{}) (*ds.MySet, *ds.AdjGraph)
NFAGenerateSubsetsAndConstructDFA 为了消除 epsilonEdge
func NFAToRegex ¶
func NodeSetToIntValueSet ¶
func RegexToNFA ¶
Types ¶
type DFA ¶
type DFA struct {
S *ISet // 有穷状态集合
Sigma *ISet // 输入符号表
InitialState *ISet // 初始状态
FinalState *ISet // 终结状态
}
DFA Deterministic finite automata
type ISet ¶
type ISet struct {
CharSet *complicated.MySet
}
func EpsilonClosure ¶
EpsilonClosure 集合I的所有状态经若干次空边到达的状态 并上 集合I
func SeparateOnlySetValue ¶
Click to show internal directories.
Click to hide internal directories.