Ideas.Common.Rule.Abstract

A rule is just a transformation with some meta-information, such as a name (which should be unique) and properties such as "buggy" or "minor". Rules can be lifted with a view using the LiftView type class.

Rule data type and accessors

data Rule a

Abstract data type for representing rules

Instances

Apply Rule

Methods

applyAll :: Rule a -> a -> [a]

LiftView Rule

Methods

liftView :: View a b -> Rule b -> Rule a

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

Recognizable Rule

Methods

recognizer :: Rule a -> Recognizer a

recognizeAll :: Rule a -> a -> a -> [Environment]

recognize :: Rule a -> a -> a -> Maybe Environment

recognizeTrans :: Rule a -> Trans (a, a) ()

IsStrategy Rule

Methods

toStrategy :: Rule a -> Strategy a

Eq (Rule a)

Methods

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

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

Ord (Rule a)

Methods

compare :: Rule a -> Rule a -> Ordering

(<) :: Rule a -> Rule a -> Bool

(<=) :: Rule a -> Rule a -> Bool

(>) :: Rule a -> Rule a -> Bool

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

max :: Rule a -> Rule a -> Rule a

min :: Rule a -> Rule a -> Rule a

Show (Rule a)

Methods

showsPrec :: Int -> Rule a -> ShowS

show :: Rule a -> String

showList :: [Rule a] -> ShowS

Minor (Rule a)

Methods

minor :: Rule a -> Rule a

setMinor :: Bool -> Rule a -> Rule a

isMinor :: Rule a -> Bool

isMajor :: Rule a -> Bool

Buggy (Rule a)

Methods

buggy :: Rule a -> Rule a

setBuggy :: Bool -> Rule a -> Rule a

isBuggy :: Rule a -> Bool

HasId (Rule a)

Methods

getId :: Rule a -> Id

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

HasRefs (Rule a)

Methods

getRefs :: Rule a -> [Some Ref]

allRefs :: Rule a -> [Some Ref]

getRefIds :: Rule a -> [Id]

LabelSymbol (Rule a)

Methods

isEnterSymbol :: Rule a -> Bool

AtomicSymbol (Rule a)

Methods

atomicOpen :: Rule a

atomicClose :: Rule a

transformation :: Rule a -> Transformation a

recognizer :: Recognizable f => f a -> Recognizer a

checkReferences :: Rule a -> Environment -> Maybe String

Constructor functions

makeRule :: (IsId n, MakeTrans f) => n -> (a -> f a) -> Rule a

ruleMaybe :: IsId n => n -> (a -> Maybe a) -> Rule a

ruleList :: IsId n => n -> (a -> [a]) -> Rule a

ruleTrans :: IsId n => n -> Transformation a -> Rule a

ruleRewrite :: RewriteRule a -> Rule a

buggyRule :: (IsId n, MakeTrans f) => n -> (a -> f a) -> Rule a

minorRule :: (IsId n, MakeTrans f) => n -> (a -> f a) -> Rule a

rewriteRule :: (IsId n, RuleBuilder f a) => n -> f -> Rule a

rewriteRules :: (IsId n, RuleBuilder f a) => n -> [f] -> Rule a

Special minor rules

idRule :: IsId n => n -> Rule a

A special (minor) rule that always returns the identity

checkRule :: IsId n => n -> (a -> Bool) -> Rule a

A special (minor) rule that checks a predicate (and returns the identity if the predicate holds)

emptyRule :: IsId n => n -> Rule a

A special (minor) rule that is never applicable (i.e., this rule always fails)

Rule properties

ruleSiblings :: Rule a -> [Id]

siblingOf :: HasId b => b -> Rule a -> Rule a

isRewriteRule :: Rule a -> Bool

doAfter :: (a -> a) -> Rule a -> Rule a

Perform the function after the rule has been fired

Recognizer

addRecognizer :: Recognizer a -> Rule a -> Rule a

addRecognizerBool :: (a -> a -> Bool) -> Rule a -> Rule a

addTransRecognizer :: (a -> a -> Bool) -> Rule a -> Rule a