Ideas.Common.Strategy.Sequence

A type class for sequences together with the Firsts type class for accessing the firsts set and ready predicate.

Sequence type class

class Sequence a where

Minimal complete definition

done, (~>), (.*.)

Associated Types

type Sym a

Methods

done :: a

The empty sequence.

(~>) :: Sym a -> a -> a infixr 5

Prepend a symbol to a sequence.

(.*.) :: a -> a -> a infixr 5

Append two sequences.

single :: Sym a -> a

Singleton sequence.

sequence :: [a] -> a

Sequential composition.

Instances

Sequence (Process a)

Associated Types

type Sym (Process a) :: *

Methods

done :: Process a

(~>) :: Sym (Process a) -> Process a -> Process a

(.*.) :: Process a -> Process a -> Process a

single :: Sym (Process a) -> Process a

sequence :: [Process a] -> Process a

Sequence (Strategy a)

Associated Types

type Sym (Strategy a) :: *

Methods

done :: Strategy a

(~>) :: Sym (Strategy a) -> Strategy a -> Strategy a

(.*.) :: Strategy a -> Strategy a -> Strategy a

single :: Sym (Strategy a) -> Strategy a

sequence :: [Strategy a] -> Strategy a

Sequence b => Sequence (a -> b)

Associated Types

type Sym (a -> b) :: *

Methods

done :: a -> b

(~>) :: Sym (a -> b) -> (a -> b) -> a -> b

(.*.) :: (a -> b) -> (a -> b) -> a -> b

single :: Sym (a -> b) -> a -> b

sequence :: [a -> b] -> a -> b

Firsts type class

class Firsts s where

Minimal complete definition

ready, firsts

Associated Types

type Elem s

The type associated with a step in the first set.

Methods

ready :: s -> Bool

The ready predicate (we are done).

firsts :: s -> [(Elem s, s)]

The firsts set.

Instances

Firsts (Process a)

Associated Types

type Elem (Process a) :: *

Methods

ready :: Process a -> Bool

firsts :: Process a -> [(Elem (Process a), Process a)]

Firsts (Prefix a)

Associated Types

type Elem (Prefix a) :: *

Methods

ready :: Prefix a -> Bool

firsts :: Prefix a -> [(Elem (Prefix a), Prefix a)]

Firsts (State a)

Associated Types

type Elem (State a) :: *

Methods

ready :: State a -> Bool

firsts :: State a -> [(Elem (State a), State a)]

firstsTree :: Firsts s => s -> DerivationTree (Elem s) s