Ideas.Common.Strategy.StrategyTree

Representation of a strategy as a cyclic tree with explicit fixed-points. The nodes in the tree are named strategy combinators. The leafs are rules.

StrategyTree type synonym

type StrategyTree a = CyclicTree (Decl Nary) (Leaf a)

data Leaf a

Constructors

LeafRule (Rule a)

LeafDyn (Dynamic a)

Instances

Apply Leaf

Methods

applyAll :: Leaf a -> a -> [a]

LiftView Leaf

Methods

liftView :: View a b -> Leaf b -> Leaf a

liftViewIn :: View a (b, c) -> Leaf b -> Leaf a

Eq (Leaf a)

Methods

(==) :: Leaf a -> Leaf a -> Bool

(/=) :: Leaf a -> Leaf a -> Bool

Show (Leaf a)

Methods

showsPrec :: Int -> Leaf a -> ShowS

show :: Leaf a -> String

showList :: [Leaf a] -> ShowS

Minor (Leaf a)

Methods

minor :: Leaf a -> Leaf a

setMinor :: Bool -> Leaf a -> Leaf a

isMinor :: Leaf a -> Bool

isMajor :: Leaf a -> Bool

HasId (Leaf a)

Methods

getId :: Leaf a -> Id

changeId :: (Id -> Id) -> Leaf a -> Leaf a

LabelSymbol (Leaf a)

Methods

isEnterSymbol :: Leaf a -> Bool

AtomicSymbol (Leaf a)

Methods

atomicOpen :: Leaf a

atomicClose :: Leaf a

treeToProcess :: StrategyTree a -> Process (Leaf a)

mapRulesInTree :: (Rule a -> Rule a) -> StrategyTree a -> StrategyTree a

Declarations (named combinators)

data Decl f

Instances

Eq (Decl f)

Methods

(==) :: Decl f -> Decl f -> Bool

(/=) :: Decl f -> Decl f -> Bool

Show (Decl f)

Methods

showsPrec :: Int -> Decl f -> ShowS

show :: Decl f -> String

showList :: [Decl f] -> ShowS

HasId (Decl f)

Methods

getId :: Decl f -> Id

changeId :: (Id -> Id) -> Decl f -> Decl f

type Combinator f = forall a. f (Process (Leaf a))

associative :: Decl f -> Decl f

isAssociative :: Decl f -> Bool

combinator :: Decl f -> Combinator f

(.=.) :: IsId n => n -> Combinator f -> Decl f infix 1

applyDecl :: Arity f => Decl f -> f (StrategyTree a)

Dynamic strategies

data Dynamic a

Instances

Apply Dynamic

Methods

applyAll :: Dynamic a -> a -> [a]

LiftView Dynamic

Methods

liftView :: View a b -> Dynamic b -> Dynamic a

liftViewIn :: View a (b, c) -> Dynamic b -> Dynamic a

IsStrategy Dynamic

Methods

toStrategy :: Dynamic a -> Strategy a

HasId (Dynamic a)

Methods

getId :: Dynamic a -> Id

changeId :: (Id -> Id) -> Dynamic a -> Dynamic a

makeDynamic :: (IsId n, IsTerm a) => n -> (a -> StrategyTree a) -> Dynamic a

dynamicToTerm :: Dynamic a -> a -> Maybe Term

dynamicTree :: Dynamic a -> a -> Maybe (StrategyTree a)

dynamicFromTerm :: Dynamic a -> Term -> Maybe (StrategyTree a)

Arities

class Arity f where

Minimal complete definition

listify, toArity, liftIso

Methods

listify :: f a -> [a] -> Maybe a

toArity :: ([a] -> a) -> f a

liftIso :: Isomorphism a b -> f a -> f b

Instances

Arity Nary

Methods

listify :: Nary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Nary a

liftIso :: Isomorphism a b -> Nary a -> Nary b

Arity Binary

Methods

listify :: Binary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Binary a

liftIso :: Isomorphism a b -> Binary a -> Binary b

Arity Unary

Methods

listify :: Unary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Unary a

liftIso :: Isomorphism a b -> Unary a -> Unary b

Arity Nullary

Methods

listify :: Nullary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Nullary a

liftIso :: Isomorphism a b -> Nullary a -> Nullary b

newtype Nullary a

Constructors

Nullary

Fields

• fromNullary :: a

Instances

Arity Nullary

Methods

listify :: Nullary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Nullary a

liftIso :: Isomorphism a b -> Nullary a -> Nullary b

newtype Unary a

Constructors

Unary

Fields

• fromUnary :: a -> a

Instances

Arity Unary

Methods

listify :: Unary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Unary a

liftIso :: Isomorphism a b -> Unary a -> Unary b

newtype Binary a

Constructors

Binary

Fields

• fromBinary :: a -> a -> a

Instances

Arity Binary

Methods

listify :: Binary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Binary a

liftIso :: Isomorphism a b -> Binary a -> Binary b

newtype Nary a

Constructors

Nary

Fields

• fromNary :: [a] -> a

Instances

Arity Nary

Methods

listify :: Nary a -> [a] -> Maybe a

toArity :: ([a] -> a) -> Nary a

liftIso :: Isomorphism a b -> Nary a -> Nary b