| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell98 |
FST.RegTypes
Description
Functions for constructing a simplified regular expression.
- class Combinators a where
- class Symbols f where
- data Reg a
- (<&>) :: Eq a => Reg a -> Reg a -> Reg a
- (<->) :: Eq a => Reg a -> Reg a -> Reg a
- complement :: Eq a => Reg a -> Reg a
- reversal :: Eq a => Reg a -> Reg a
- allFree :: Eq a => Reg a -> [a] -> Reg a
- s :: a -> Reg a
- eps :: Reg a
- allS :: Reg a
- allToSymbols :: Eq a => [a] -> Reg a
- acceptEps :: Eq a => Reg a -> Bool
Type classes
class Combinators a where Source
Combinators. The regular expressions are simplified while combined.
Methods
Arguments
| :: a | |
| -> a | |
| -> a | Union |
Arguments
| :: a | |
| -> a | |
| -> a | Concatenation |
Arguments
| :: a | |
| -> a | Kleene's star |
Arguments
| :: a | |
| -> a | Kleene's plus |
Arguments
| :: a | Empty language |
Instances
| Eq a => Combinators (Reg a) | |
| Eq a => Combinators (RReg a) |
Type class for the collection of symbols in an expression.
Types
Data type for a regular expression.
Combinators
complement :: Eq a => Reg a -> Reg a Source
Complement
allFree :: Eq a => Reg a -> [a] -> Reg a Source
Construct a ?-free regular expression with respect to an alphabet [a]
Constructors
allToSymbols :: Eq a => [a] -> Reg a Source
Transform the all symbol to union over alphabet. ? -> [a|..] with respect to an alphabet [a]