dfa

package
v0.1.0 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Jan 21, 2022 License: GPL-3.0 Imports: 6 Imported by: 0

Documentation

Overview

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

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Node 

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

func NewFromNFA 

func NewFromNFA(nfanode *nfa.Node) *Node

func (Node) NextState 

func (n Node) NextState(r []rune) *Node

func (Node) Print 

func (n Node) Print()

type T 

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

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.