Copyright	disco team and contributors
Maintainer	byorgey@gmail.com
Safe Haskell	Safe-Inferred
Language	Haskell2010

Disco.Syntax.Operators

Contents

Operators
Operator info
Operator tables and lookup

Description

Unary and binary operators along with information like precedence, fixity, and concrete syntax.

Synopsis

data UOp
- = Neg
- | Not
- | Fact
data BOp
- = Add
- | Sub
- | SSub
- | Mul
- | Div
- | Exp
- | IDiv
- | Eq
- | Neq
- | Lt
- | Gt
- | Leq
- | Geq
- | Min
- | Max
- | And
- | Or
- | Impl
- | Iff
- | Mod
- | Divides
- | Choose
- | Cons
- | CartProd
- | Union
- | Inter
- | Diff
- | Elem
- | Subset
- | ShouldEq
- | ShouldLt
data TyOp
- = Enumerate
- | Count
data UFixity
- = Pre
- | Post
data BFixity
- = InL
- | InR
- | In
data OpFixity
- = UOpF UFixity UOp
- | BOpF BFixity BOp
data OpInfo = OpInfo {
- opFixity :: OpFixity
- opSyns :: [String]
- opPrec :: Int
}
opTable :: [[OpInfo]]
uopMap :: Map UOp OpInfo
bopMap :: Map BOp OpInfo
uPrec :: UOp -> Int
bPrec :: BOp -> Int
assoc :: BOp -> BFixity
funPrec :: Int

Operators

data UOp Source #

Unary operators.

Constructors

Neg	Arithmetic negation (`-`)
Not	Logical negation (`not`)
Fact	Factorial (`!`)

Instances

Instances details

Data UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UOp -> c UOp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UOp # toConstr :: UOp -> Constr # dataTypeOf :: UOp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UOp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UOp) # gmapT :: (forall b. Data b => b -> b) -> UOp -> UOp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UOp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UOp -> r # gmapQ :: (forall d. Data d => d -> u) -> UOp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UOp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UOp -> m UOp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UOp -> m UOp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UOp -> m UOp #
Generic UOp Source #
Instance details Defined in Disco.Syntax.Operators Associated Types type Rep UOp :: Type -> Type # Methods from :: UOp -> Rep UOp x # to :: Rep UOp x -> UOp #
Read UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods readsPrec :: Int -> ReadS UOp # readList :: ReadS [UOp] # readPrec :: ReadPrec UOp # readListPrec :: ReadPrec [UOp] #
Show UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> UOp -> ShowS # show :: UOp -> String # showList :: [UOp] -> ShowS #
Pretty UOp Source #	Pretty-print a unary operator, by looking up its concrete syntax in the `uopMap`.
Instance details Defined in Disco.Pretty Methods pretty :: forall (r :: EffectRow) ann. Members '[Reader PA, LFresh] r => UOp -> Sem r (Doc ann) Source #
Eq UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods (==) :: UOp -> UOp -> Bool # (/=) :: UOp -> UOp -> Bool #
Ord UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods compare :: UOp -> UOp -> Ordering # (<) :: UOp -> UOp -> Bool # (<=) :: UOp -> UOp -> Bool # (>) :: UOp -> UOp -> Bool # (>=) :: UOp -> UOp -> Bool # max :: UOp -> UOp -> UOp # min :: UOp -> UOp -> UOp #
Alpha UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods aeq' :: AlphaCtx -> UOp -> UOp -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> UOp -> f UOp # close :: AlphaCtx -> NamePatFind -> UOp -> UOp # open :: AlphaCtx -> NthPatFind -> UOp -> UOp # isPat :: UOp -> DisjointSet AnyName # isTerm :: UOp -> All # isEmbed :: UOp -> Bool # nthPatFind :: UOp -> NthPatFind # namePatFind :: UOp -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> UOp -> UOp # lfreshen' :: LFresh m => AlphaCtx -> UOp -> (UOp -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> UOp -> m (UOp, Perm AnyName) # acompare' :: AlphaCtx -> UOp -> UOp -> Ordering #
Subst t UOp Source #
Instance details Defined in Disco.Syntax.Operators Methods isvar :: UOp -> Maybe (SubstName UOp t) # isCoerceVar :: UOp -> Maybe (SubstCoerce UOp t) # subst :: Name t -> t -> UOp -> UOp # substs :: [(Name t, t)] -> UOp -> UOp #
type Rep UOp Source #
Instance details Defined in Disco.Syntax.Operators type Rep UOp = D1 ('MetaData "UOp" "Disco.Syntax.Operators" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) (C1 ('MetaCons "Neg" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Not" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Fact" 'PrefixI 'False) (U1 :: Type -> Type)))

data BOp Source #

Binary operators.

Constructors

Add	Addition (`+`)
Sub	Subtraction (`-`)
SSub	Saturating Subtraction (`.-` / `∸`)
Mul	Multiplication (`*`)
Div	Division (`/`)
Exp	Exponentiation (`^`)
IDiv	Integer division (`//`)
Eq	Equality test (`==`)
Neq	Not-equal (`/=`)
Lt	Less than (`<`)
Gt	Greater than (`>`)
Leq	Less than or equal (`<=`)
Geq	Greater than or equal (`>=`)
Min	Minimum (`min`)
Max	Maximum (`max`)
And	Logical and (`&&` / `and`)
Or	Logical or (`\|\|` / `or`)
Impl	Logical implies (`->` / `implies`)
Iff	Logical biconditional (`-` / `iff`)
Mod	Modulo (`mod`)
Divides	Divisibility test (`\|`)
Choose	Binomial and multinomial coefficients (`choose`)
Cons	List cons (`::`)
CartProd	Cartesian product of sets (`**` / `⨯`)
Union	Union of two sets (`union` / `∪`)
Inter	Intersection of two sets (`intersect` / `∩`)
Diff	Difference between two sets (@@)
Elem	Element test (`∈`)
Subset	Subset test (`⊆`)
ShouldEq	Equality assertion (`=!=`)
ShouldLt	Less than assertion (`!<`)

Instances

Instances details

Data BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BOp -> c BOp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BOp # toConstr :: BOp -> Constr # dataTypeOf :: BOp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BOp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BOp) # gmapT :: (forall b. Data b => b -> b) -> BOp -> BOp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BOp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BOp -> r # gmapQ :: (forall d. Data d => d -> u) -> BOp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BOp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BOp -> m BOp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BOp -> m BOp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BOp -> m BOp #
Generic BOp Source #
Instance details Defined in Disco.Syntax.Operators Associated Types type Rep BOp :: Type -> Type # Methods from :: BOp -> Rep BOp x # to :: Rep BOp x -> BOp #
Read BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods readsPrec :: Int -> ReadS BOp # readList :: ReadS [BOp] # readPrec :: ReadPrec BOp # readListPrec :: ReadPrec [BOp] #
Show BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> BOp -> ShowS # show :: BOp -> String # showList :: [BOp] -> ShowS #
Pretty BOp Source #	Pretty-print a binary operator, by looking up its concrete syntax in the `bopMap`.
Instance details Defined in Disco.Pretty Methods pretty :: forall (r :: EffectRow) ann. Members '[Reader PA, LFresh] r => BOp -> Sem r (Doc ann) Source #
Eq BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods (==) :: BOp -> BOp -> Bool # (/=) :: BOp -> BOp -> Bool #
Ord BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods compare :: BOp -> BOp -> Ordering # (<) :: BOp -> BOp -> Bool # (<=) :: BOp -> BOp -> Bool # (>) :: BOp -> BOp -> Bool # (>=) :: BOp -> BOp -> Bool # max :: BOp -> BOp -> BOp # min :: BOp -> BOp -> BOp #
Alpha BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods aeq' :: AlphaCtx -> BOp -> BOp -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> BOp -> f BOp # close :: AlphaCtx -> NamePatFind -> BOp -> BOp # open :: AlphaCtx -> NthPatFind -> BOp -> BOp # isPat :: BOp -> DisjointSet AnyName # isTerm :: BOp -> All # isEmbed :: BOp -> Bool # nthPatFind :: BOp -> NthPatFind # namePatFind :: BOp -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> BOp -> BOp # lfreshen' :: LFresh m => AlphaCtx -> BOp -> (BOp -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> BOp -> m (BOp, Perm AnyName) # acompare' :: AlphaCtx -> BOp -> BOp -> Ordering #
Subst t BOp Source #
Instance details Defined in Disco.Syntax.Operators Methods isvar :: BOp -> Maybe (SubstName BOp t) # isCoerceVar :: BOp -> Maybe (SubstCoerce BOp t) # subst :: Name t -> t -> BOp -> BOp # substs :: [(Name t, t)] -> BOp -> BOp #
type Rep BOp Source #
Instance details Defined in Disco.Syntax.Operators type Rep BOp = D1 ('MetaData "BOp" "Disco.Syntax.Operators" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) ((((C1 ('MetaCons "Add" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Sub" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SSub" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "Mul" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Div" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Exp" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IDiv" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "Eq" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Neq" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Lt" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Gt" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "Leq" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Geq" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Min" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Max" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "And" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Or" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Impl" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Iff" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "Mod" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Divides" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Choose" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Cons" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "CartProd" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Union" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Inter" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Diff" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "Elem" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Subset" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ShouldEq" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ShouldLt" 'PrefixI 'False) (U1 :: Type -> Type))))))

data TyOp Source #

Type operators.

Constructors

Enumerate	List all values of a type
Count	Count how many values there are of a type

Instances

Instances details

Data TyOp Source #
Instance details Defined in Disco.Syntax.Operators Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyOp -> c TyOp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TyOp # toConstr :: TyOp -> Constr # dataTypeOf :: TyOp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TyOp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TyOp) # gmapT :: (forall b. Data b => b -> b) -> TyOp -> TyOp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyOp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyOp -> r # gmapQ :: (forall d. Data d => d -> u) -> TyOp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TyOp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyOp -> m TyOp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyOp -> m TyOp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyOp -> m TyOp #
Generic TyOp Source #
Instance details Defined in Disco.Syntax.Operators Associated Types type Rep TyOp :: Type -> Type # Methods from :: TyOp -> Rep TyOp x # to :: Rep TyOp x -> TyOp #
Show TyOp Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> TyOp -> ShowS # show :: TyOp -> String # showList :: [TyOp] -> ShowS #
Pretty TyOp Source #
Instance details Defined in Disco.Pretty Methods pretty :: forall (r :: EffectRow) ann. Members '[Reader PA, LFresh] r => TyOp -> Sem r (Doc ann) Source #
Eq TyOp Source #
Instance details Defined in Disco.Syntax.Operators Methods (==) :: TyOp -> TyOp -> Bool # (/=) :: TyOp -> TyOp -> Bool #
Ord TyOp Source #
Instance details Defined in Disco.Syntax.Operators Methods compare :: TyOp -> TyOp -> Ordering # (<) :: TyOp -> TyOp -> Bool # (<=) :: TyOp -> TyOp -> Bool # (>) :: TyOp -> TyOp -> Bool # (>=) :: TyOp -> TyOp -> Bool # max :: TyOp -> TyOp -> TyOp # min :: TyOp -> TyOp -> TyOp #
Alpha TyOp Source #
Instance details Defined in Disco.Syntax.Operators Methods aeq' :: AlphaCtx -> TyOp -> TyOp -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> TyOp -> f TyOp # close :: AlphaCtx -> NamePatFind -> TyOp -> TyOp # open :: AlphaCtx -> NthPatFind -> TyOp -> TyOp # isPat :: TyOp -> DisjointSet AnyName # isTerm :: TyOp -> All # isEmbed :: TyOp -> Bool # nthPatFind :: TyOp -> NthPatFind # namePatFind :: TyOp -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> TyOp -> TyOp # lfreshen' :: LFresh m => AlphaCtx -> TyOp -> (TyOp -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> TyOp -> m (TyOp, Perm AnyName) # acompare' :: AlphaCtx -> TyOp -> TyOp -> Ordering #
Subst t TyOp Source #
Instance details Defined in Disco.Syntax.Operators Methods isvar :: TyOp -> Maybe (SubstName TyOp t) # isCoerceVar :: TyOp -> Maybe (SubstCoerce TyOp t) # subst :: Name t -> t -> TyOp -> TyOp # substs :: [(Name t, t)] -> TyOp -> TyOp #
type Rep TyOp Source #
Instance details Defined in Disco.Syntax.Operators type Rep TyOp = D1 ('MetaData "TyOp" "Disco.Syntax.Operators" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) (C1 ('MetaCons "Enumerate" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Count" 'PrefixI 'False) (U1 :: Type -> Type))

Operator info

data UFixity Source #

Fixities of unary operators (either pre- or postfix).

Constructors

Pre	Unary prefix.
Post	Unary postfix.

Instances

Instances details

Bounded UFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods minBound :: UFixity # maxBound :: UFixity #
Enum UFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods succ :: UFixity -> UFixity # pred :: UFixity -> UFixity # toEnum :: Int -> UFixity # fromEnum :: UFixity -> Int # enumFrom :: UFixity -> [UFixity] # enumFromThen :: UFixity -> UFixity -> [UFixity] # enumFromTo :: UFixity -> UFixity -> [UFixity] # enumFromThenTo :: UFixity -> UFixity -> UFixity -> [UFixity] #
Generic UFixity Source #
Instance details Defined in Disco.Syntax.Operators Associated Types type Rep UFixity :: Type -> Type # Methods from :: UFixity -> Rep UFixity x # to :: Rep UFixity x -> UFixity #
Show UFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> UFixity -> ShowS # show :: UFixity -> String # showList :: [UFixity] -> ShowS #
Eq UFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods (==) :: UFixity -> UFixity -> Bool # (/=) :: UFixity -> UFixity -> Bool #
Ord UFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods compare :: UFixity -> UFixity -> Ordering # (<) :: UFixity -> UFixity -> Bool # (<=) :: UFixity -> UFixity -> Bool # (>) :: UFixity -> UFixity -> Bool # (>=) :: UFixity -> UFixity -> Bool # max :: UFixity -> UFixity -> UFixity # min :: UFixity -> UFixity -> UFixity #
type Rep UFixity Source #
Instance details Defined in Disco.Syntax.Operators type Rep UFixity = D1 ('MetaData "UFixity" "Disco.Syntax.Operators" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) (C1 ('MetaCons "Pre" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Post" 'PrefixI 'False) (U1 :: Type -> Type))

data BFixity Source #

Fixity/associativity of infix binary operators (either left, right, or non-associative).

Constructors

InL	Left-associative infix.
InR	Right-associative infix.
In	Infix.

Instances

Instances details

Bounded BFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods minBound :: BFixity # maxBound :: BFixity #
Enum BFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods succ :: BFixity -> BFixity # pred :: BFixity -> BFixity # toEnum :: Int -> BFixity # fromEnum :: BFixity -> Int # enumFrom :: BFixity -> [BFixity] # enumFromThen :: BFixity -> BFixity -> [BFixity] # enumFromTo :: BFixity -> BFixity -> [BFixity] # enumFromThenTo :: BFixity -> BFixity -> BFixity -> [BFixity] #
Generic BFixity Source #
Instance details Defined in Disco.Syntax.Operators Associated Types type Rep BFixity :: Type -> Type # Methods from :: BFixity -> Rep BFixity x # to :: Rep BFixity x -> BFixity #
Show BFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> BFixity -> ShowS # show :: BFixity -> String # showList :: [BFixity] -> ShowS #
Eq BFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods (==) :: BFixity -> BFixity -> Bool # (/=) :: BFixity -> BFixity -> Bool #
Ord BFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods compare :: BFixity -> BFixity -> Ordering # (<) :: BFixity -> BFixity -> Bool # (<=) :: BFixity -> BFixity -> Bool # (>) :: BFixity -> BFixity -> Bool # (>=) :: BFixity -> BFixity -> Bool # max :: BFixity -> BFixity -> BFixity # min :: BFixity -> BFixity -> BFixity #
type Rep BFixity Source #
Instance details Defined in Disco.Syntax.Operators type Rep BFixity = D1 ('MetaData "BFixity" "Disco.Syntax.Operators" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) (C1 ('MetaCons "InL" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "InR" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "In" 'PrefixI 'False) (U1 :: Type -> Type)))

data OpFixity Source #

Operators together with their fixity.

Constructors

UOpF UFixity UOp
BOpF BFixity BOp

Instances

Instances details

Generic OpFixity Source #
Instance details Defined in Disco.Syntax.Operators Associated Types type Rep OpFixity :: Type -> Type # Methods from :: OpFixity -> Rep OpFixity x # to :: Rep OpFixity x -> OpFixity #
Show OpFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> OpFixity -> ShowS # show :: OpFixity -> String # showList :: [OpFixity] -> ShowS #
Eq OpFixity Source #
Instance details Defined in Disco.Syntax.Operators Methods (==) :: OpFixity -> OpFixity -> Bool # (/=) :: OpFixity -> OpFixity -> Bool #
type Rep OpFixity Source #
Instance details Defined in Disco.Syntax.Operators type Rep OpFixity = D1 ('MetaData "OpFixity" "Disco.Syntax.Operators" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) (C1 ('MetaCons "UOpF" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UFixity) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UOp)) :+: C1 ('MetaCons "BOpF" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BFixity) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BOp)))

data OpInfo Source #

An OpInfo record contains information about an operator, such as the operator itself, its fixity, a list of concrete syntax representations, and a numeric precedence level.

Constructors

OpInfo
Fields opFixity :: OpFixity opSyns :: [String] opPrec :: Int

Instances

Instances details

Show OpInfo Source #
Instance details Defined in Disco.Syntax.Operators Methods showsPrec :: Int -> OpInfo -> ShowS # show :: OpInfo -> String # showList :: [OpInfo] -> ShowS #

Operator tables and lookup

opTable :: [[OpInfo]] Source #

The opTable lists all the operators in the language, in order of precedence (highest precedence first). Operators in the same list have the same precedence. This table is used by both the parser and the pretty-printer.

uopMap :: Map UOp OpInfo Source #

A map from all unary operators to their associated OpInfo records.

bopMap :: Map BOp OpInfo Source #

A map from all binary operators to their associatied OpInfo records.

uPrec :: UOp -> Int Source #

A convenient function for looking up the precedence of a unary operator.

bPrec :: BOp -> Int Source #

A convenient function for looking up the precedence of a binary operator.

assoc :: BOp -> BFixity Source #

Look up the "fixity" (i.e. associativity) of a binary operator.

funPrec :: Int Source #

The precedence level of function application (higher than any other precedence level).