Text.Regex.PDeriv.Nfa

This module defines data types, type classes and instances for NFA

Documentation

class Nfa s a | s -> a where

The type class of Nfa

Minimal complete definition

pDeriv, sigma, empty

Methods

pDeriv :: s -> a -> [s]

sigma :: s -> [a]

empty :: s -> Bool

buildNFA :: (Nfa s a, Eq s, Eq a) => s -> NFA s a

A function that builds an NFA

data NFA s a

the NFA data type

Constructors

NFA

Fields

• all_states :: [s]
• delta_states :: [(s, a, s)]
• init_states :: [s]
• final_states :: [s]

Instances

(Show a, Show s) => Show (NFA s a)

Methods

showsPrec :: Int -> NFA s a -> ShowS

show :: NFA s a -> String

showList :: [NFA s a] -> ShowS

data SNFA s a

the optimized NFA using Int to represent states, IntMap to represent delta

Constructors

SNFA

Fields

• mapping_states :: s -> Int
• sall_states :: [Int]
• sdelta_states :: [(Int, a, Int)]
• sinit_states :: [Int]
• sfinal_states :: [Int]

Instances

Show a => Show (SNFA s a)

Methods

showsPrec :: Int -> SNFA s a -> ShowS

show :: SNFA s a -> String

showList :: [SNFA s a] -> ShowS

toSNFA :: (Eq s, Eq a) => NFA s a -> SNFA s a

The function toSNFA converts from an NFA to an SNFA

nofAllStates :: NFA a t -> Int

nofDelta :: NFA t1 t -> Int

nofInitStates :: NFA a t -> Int

nofFinalStates :: NFA a t -> Int