t-regex-0.1.0.0: Matchers and grammars using tree regular expressions

Safe Haskell	None
Language	Haskell2010

Data.Regex.Example.FPDag2015

Documentation

data List_ a l Source

Constructors

Cons_ a l
Nil_

Instances

Generic1 (List_ a)
Arbitrary a => Arbitrary (List a)
(Show a, Show l) => Show (List_ a l)
type Rep1 (List_ a)

type List a = Fix (List_ a) Source

pattern Cons t (Fix (List_ t)) :: Fix (List_ t) Source

pattern Nil :: Fix (List_ t) Source

oneTwoOrOneThree :: Regex c (List_ Int) Source

oneTwoThree :: List Char -> Bool Source

data Tree_ t Source

Constructors

Node_ Int t t
Leaf_ Int

Instances

Generic1 Tree_
Show t => Show (Tree_ t)
type Rep1 Tree_

type Tree = Fix Tree_ Source

pattern Node Int (Fix Tree_) (Fix Tree_) :: Fix Tree_ Source

pattern Leaf Int :: Fix Tree_ Source

matchAny :: Regex c Tree_ Source

topTwo :: Regex c Tree_ Source

shape1 :: Regex c Tree_ Source

shape2 :: Regex c Tree_ Source

allTwos :: Regex c Tree_ Source

allTwosPostfix :: Regex c Tree_ Source

allLeaves :: Tree -> [Int] Source

data Expr_ e Source

Constructors

Plus_ e e
Times_ e e
Var_ Int

Instances

Generic1 Expr_
Show e => Show (Expr_ e)
type Rep1 Expr_

type Expr = Fix Expr_ Source

iPlus :: Regex' k c Expr_ -> Regex' k c Expr_ -> Regex' k c Expr_ Source

iTimes :: Regex' k c Expr_ -> Regex' k c Expr_ -> Regex' k c Expr_ Source

iVar :: Int -> Regex' k c Expr_ Source

simplify :: Expr -> Expr Source