nfa

Documentation

Overview

Package nfa provides a way to construct non-deterministic finite automata from regular expressions using the Thompson's construction algorithm.

Index

• Constants
• type Node
  • func New(pattern string) (*Node, error)
  • func NewFromRegexp(r *syntax.Regexp) *Node
• type T

Constants

const (
	// Last unicode rune
	RuneLast = 0x10ffff

	// Pseudo-runes
	RuneBeginText = -100 * iota
	RuneEndText
	RuneBeginLine
	RuneEndLine
	RuneWordBoundary
	RuneNoWordBoundary
	RuneLazy
)

Types

type Node

type Node struct {
	S int  // state
	F bool // final?
	T []T  // transitions
}

func New

func New(pattern string) (*Node, error)

func NewFromRegexp

func NewFromRegexp(r *syntax.Regexp) *Node

type T

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