fungll-combinators-0.1.0.1: GLL parser with simple combinator interface

Safe HaskellSafe
LanguageHaskell2010

GLL.Types.DataSets

Documentation

type Descr t = (Slot t, Int, Int) Source #

type Comm t = (Nt, Int) Source #

data Cont t c Source #

Constructors

Cont (Slot t, Int) c 
Instances
Eq t => Eq (Cont t c) Source # 
Instance details

Defined in GLL.Types.DataSets

Methods

(==) :: Cont t c -> Cont t c -> Bool #

(/=) :: Cont t c -> Cont t c -> Bool #

Ord t => Ord (Cont t c) Source # 
Instance details

Defined in GLL.Types.DataSets

Methods

compare :: Cont t c -> Cont t c -> Ordering #

(<) :: Cont t c -> Cont t c -> Bool #

(<=) :: Cont t c -> Cont t c -> Bool #

(>) :: Cont t c -> Cont t c -> Bool #

(>=) :: Cont t c -> Cont t c -> Bool #

max :: Cont t c -> Cont t c -> Cont t c #

min :: Cont t c -> Cont t c -> Cont t c #

data State t c Source #

Constructors

State 

Fields

addDescr :: Ord t => Descr t -> USet t -> USet t Source #

hasDescr :: Ord t => Descr t -> USet t -> Bool Source #

addCont :: Ord t => Comm t -> (Slot t, Int, c) -> GRel t c -> GRel t c Source #

conts :: Comm t -> GRel t c -> [(Slot t, Int, c)] Source #

addExtent :: Comm t -> Int -> PRel t -> PRel t Source #

extents :: Comm t -> PRel t -> [Int] Source #

type RList t = [Descr t] Source #

type USet t = IntMap (IntMap (Set (Slot t))) Source #

type GRel t c = IntMap (Map Nt (Set (Cont t c))) Source #

type PRel t = IntMap (Map Nt [Int]) Source #

descrs2list :: USet t -> [(Slot t, Int, Int)] Source #

printDescrs :: Show t => USet t -> IO () Source #

popRList :: [a] -> (a, [a]) Source #

unionRList :: [a] -> [a] -> [a] Source #

singletonRList :: a -> [a] Source #

fromListRList :: Ord t => [Descr t] -> USet t -> RList t Source #

singleCG :: Ord t => Comm t -> (Slot t, Int, c) -> GRel t c Source #