Copyright	(c) Karl Cronburg 2018
License	BSD3
Maintainer	karl@cs.tufts.edu
Stability	experimental
Portability	POSIX
Safe Haskell	None
Language	Haskell2010

Text.ANTLR.Allstar.Stacks

Description

Synopsis

data Stacks a
- = Empty
- | Wildcard
- | Stacks (Set [a])
(#) :: Stacks a
merge :: (Eq a, Hashable a) => Stacks a -> Stacks a -> Stacks a
push :: (Eq a, Hashable a) => a -> Stacks a -> Stacks a
pop :: (Eq a, Hashable a) => Stacks a -> [(a, Stacks a)]

Documentation

data Stacks a Source #

Graph-structured stack representation

Constructors

Empty
Wildcard
Stacks (Set [a])

Instances

Eq a => Eq (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks Methods (==) :: Stacks a -> Stacks a -> Bool # (/=) :: Stacks a -> Stacks a -> Bool #
Ord a => Ord (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks Methods compare :: Stacks a -> Stacks a -> Ordering # (<) :: Stacks a -> Stacks a -> Bool # (<=) :: Stacks a -> Stacks a -> Bool # (>) :: Stacks a -> Stacks a -> Bool # (>=) :: Stacks a -> Stacks a -> Bool # max :: Stacks a -> Stacks a -> Stacks a # min :: Stacks a -> Stacks a -> Stacks a #
Show a => Show (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks Methods showsPrec :: Int -> Stacks a -> ShowS # show :: Stacks a -> String # showList :: [Stacks a] -> ShowS #
Generic (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks Associated Types type Rep (Stacks a) :: Type -> Type # Methods from :: Stacks a -> Rep (Stacks a) x # to :: Rep (Stacks a) x -> Stacks a #
Hashable a => Hashable (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks Methods hashWithSalt :: Int -> Stacks a -> Int # hash :: Stacks a -> Int #
(Prettify a, Hashable a, Eq a) => Prettify (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks Methods prettify :: Stacks a -> Pretty Source # prettifyList :: [Stacks a] -> Pretty Source #
type Rep (Stacks a) Source #
Instance details Defined in Text.ANTLR.Allstar.Stacks type Rep (Stacks a) = D1 (MetaData "Stacks" "Text.ANTLR.Allstar.Stacks" "antlr-haskell-0.1.0.0-I1YLZdM1Y3a3syLrgVdT7Y" False) (C1 (MetaCons "Empty" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "Wildcard" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Stacks" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Set [a])))))

(#) :: Stacks a Source #

Represents the set of all stacks

merge :: (Eq a, Hashable a) => Stacks a -> Stacks a -> Stacks a Source #

Combine two GSSs

push :: (Eq a, Hashable a) => a -> Stacks a -> Stacks a Source #

Push a state onto all the leaves of the given GSS

pop :: (Eq a, Hashable a) => Stacks a -> [(a, Stacks a)] Source #

Pop off all the current states from the given GSS