dfa

Documentation

Overview

Package dfa implements Deterministic Finite Automaton(DFA).

Index

• type DFA
  • func NewDFA(init utils.State, accepts mapset.Set, rules dfarule.RuleMap) *DFA
  • func (dfa *DFA) GetRuntime() *Runtime
  • func (dfa *DFA) Minimize()
• type Runtime
  • func NewRuntime(d *DFA) (r *Runtime)
  • func (r *Runtime) Matching(str string) bool

Types

type DFA

type DFA struct {
	I     utils.State     // initial state
	F     mapset.Set      // accepts states
	Rules dfarule.RuleMap // transition function
}

DFA represents a Deterministic Finite Automaton.

func NewDFA

func NewDFA(init utils.State, accepts mapset.Set, rules dfarule.RuleMap) *DFA

NewDFA returns a new dfa.

func (*DFA) GetRuntime

func (dfa *DFA) GetRuntime() *Runtime

GetRuntime returns a new Runtime for simulating d transitions.

func (*DFA) Minimize

func (dfa *DFA) Minimize()

Minimize minimizes the DFA.

type Runtime

type Runtime struct {
	// contains filtered or unexported fields
}

Runtime has a pointer to d and saves current state for simulating d transitions.

func NewRuntime

func NewRuntime(d *DFA) (r *Runtime)

NewRuntime returns a new runtime for DFA.

func (*Runtime) Matching

func (r *Runtime) Matching(str string) bool

Matching returns whether the string given is accepted (or not) by simulating the all transitions.