Copyright	(c) João Saraiva 20012002200320042005
License	LGPL
Maintainer	jas@di.uminho.pt
Stability	provisional
Portability	portable
Safe Haskell	Safe
Language	Haskell98

Language.HaLex.FaClasses

Description

The Class of Finite Automaton in Haskell

Code Included in the Lecture Notes on Language Processing (with a functional flavour).

Synopsis

Documentation

class Fa fa st sy where Source #

Class of Finite automaton

Minimal complete definition

accept, sizeFa, equiv, minimize, reverseFa, deadstates, sentences, toHaskell', toGraph, toGraphIO, unionFa, concatFa, starFa, plusFa

Methods

accept :: fa st sy -> [sy] -> Bool Source #

sizeFa :: fa st sy -> Int Source #

equiv :: fa st sy -> fa st sy -> Bool Source #

minimize :: fa st sy -> Dfa [[st]] sy Source #

reverseFa :: fa st sy -> Ndfa st sy Source #

deadstates :: fa st sy -> [st] Source #

sentences :: fa st sy -> [[sy]] Source #

toHaskell' :: fa st sy -> String -> IO () Source #

toGraph :: fa st sy -> String -> String Source #

toGraphIO :: fa st sy -> String -> IO () Source #

unionFa :: fa st sy -> fa st sy -> Ndfa st sy Source #

concatFa :: fa st sy -> fa st sy -> Ndfa st sy Source #

starFa :: fa st sy -> Ndfa st sy Source #

plusFa :: fa st sy -> Ndfa st sy Source #

Instances

(Show st, Show sy, Ord st, Ord sy) => Fa Dfa st sy Source #	Instance of class `Fa` for a `Dfa`
Methods accept :: Dfa st sy -> [sy] -> Bool Source # sizeFa :: Dfa st sy -> Int Source # equiv :: Dfa st sy -> Dfa st sy -> Bool Source # minimize :: Dfa st sy -> Dfa [[st]] sy Source # reverseFa :: Dfa st sy -> Ndfa st sy Source # deadstates :: Dfa st sy -> [st] Source # sentences :: Dfa st sy -> [[sy]] Source # toHaskell' :: Dfa st sy -> String -> IO () Source # toGraph :: Dfa st sy -> String -> String Source # toGraphIO :: Dfa st sy -> String -> IO () Source # unionFa :: Dfa st sy -> Dfa st sy -> Ndfa st sy Source # concatFa :: Dfa st sy -> Dfa st sy -> Ndfa st sy Source # starFa :: Dfa st sy -> Ndfa st sy Source # plusFa :: Dfa st sy -> Ndfa st sy Source #
(Show st, Show sy, Ord st, Ord sy) => Fa Ndfa st sy Source #	Instance of class `Fa` for a `Ndfa`
Methods accept :: Ndfa st sy -> [sy] -> Bool Source # sizeFa :: Ndfa st sy -> Int Source # equiv :: Ndfa st sy -> Ndfa st sy -> Bool Source # minimize :: Ndfa st sy -> Dfa [[st]] sy Source # reverseFa :: Ndfa st sy -> Ndfa st sy Source # deadstates :: Ndfa st sy -> [st] Source # sentences :: Ndfa st sy -> [[sy]] Source # toHaskell' :: Ndfa st sy -> String -> IO () Source # toGraph :: Ndfa st sy -> String -> String Source # toGraphIO :: Ndfa st sy -> String -> IO () Source # unionFa :: Ndfa st sy -> Ndfa st sy -> Ndfa st sy Source # concatFa :: Ndfa st sy -> Ndfa st sy -> Ndfa st sy Source # starFa :: Ndfa st sy -> Ndfa st sy Source # plusFa :: Ndfa st sy -> Ndfa st sy Source #