Math.Model.Automaton.Stack

Stack Automaton

Documentation

type Delta a = (:->:) a (Maybe Symbol, Symbol) Wd

Delta for stack machine, takes a state, a symbol in string input or not and a symbol in stack head and returns next state and update stack

type Key a = (Label a, (Maybe Symbol, Symbol))

A key for a delta.

liftDelta :: Ord a => [(a, Wd, Symbol, a, Wd)] -> Delta a

Takes a list of tuples and lift a Delta

>>> let delta = liftD [(0,"(",'Z',0,"IZ"),(0,"",'Z',0,""),(0,"(",'I',0,"II"),(0,")",'I',0,"")]

nextDTuple :: Ord a => Delta a -> Key a -> (Label a, Wd)

data StackA a

Stack machine only needs a delta, an init state and an initial symbol.

This works for empty stack and final state acceptor

Constructors

Stack

Fields

• getDelta :: Delta a
• getInitState :: Label a
• getFinal :: Final a
• getInitSymbol :: Symbol

Instances

Eq a => Eq (StackA a)

Methods

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

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

Show a => Show (StackA a)

Methods

showsPrec :: Int -> StackA a -> ShowS

show :: StackA a -> String

showList :: [StackA a] -> ShowS

nextState :: Ord a => Delta a -> Wd -> State (Wd, Label a) (Label a)