dfa

Documentation

Overview

Package dfa provides a way to construct deterministic finite automata from non-deterministic finite automata.

Index

• type Node
  • func NewFromNFA(nfanode *nfa.Node) *Node
• type T

Types

type Node

type Node struct {
	S int  // state
	F bool // final?
	T []T  // transitions
	// contains filtered or unexported fields
}

func NewFromNFA

func NewFromNFA(nfanode *nfa.Node) *Node

type T

type T struct {
	R []rune // rune ranges
	N *Node  // node
}