Safe Haskell	None
Language	Haskell2010

Language.Symantic.Grammar.Fixity

Contents

Type Fixity
- Type Unifix
- Type Infix
Type Precedence
- Class PrecedenceOf
Type Associativity
- Type Side
- Type Pair

Synopsis

data Fixity
- = Fixity1 Unifix
- | Fixity2 Infix
data Unifix
- = Prefix {
  - unifix_precedence :: Precedence
  }
- | Postfix {
  - unifix_precedence :: Precedence
  }
data Infix = Infix {
- infix_associativity :: Maybe Associativity
- infix_precedence :: Precedence
}
infixL :: Precedence -> Infix
infixR :: Precedence -> Infix
infixB :: Side -> Precedence -> Infix
infixN :: Precedence -> Infix
infixN0 :: Infix
infixN5 :: Infix
isPairNeeded :: (Infix, Side) -> Infix -> Bool
pairIfNeeded :: Semigroup s => IsString s => Pair -> (Infix, Side) -> Infix -> s -> s
type Precedence = Int
class PrecedenceOf a where
- precedence :: a -> Precedence
data Associativity
- = AssocL
- | AssocR
- | AssocB Side
data Side
- = SideL
- | SideR
type Pair = (String, String)
pairParen :: Pair
pairBrace :: Pair

Type `Fixity`

data Fixity Source #

Constructors

Fixity1 Unifix
Fixity2 Infix

Instances

Eq Fixity Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #
Show Fixity Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods showsPrec :: Int -> Fixity -> ShowS # show :: Fixity -> String # showList :: [Fixity] -> ShowS #
PrecedenceOf Fixity Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods precedence :: Fixity -> Precedence Source #

Type `Unifix`

data Unifix Source #

Constructors

Prefix
Fields unifix_precedence :: Precedence
Postfix
Fields unifix_precedence :: Precedence

Instances

Eq Unifix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods (==) :: Unifix -> Unifix -> Bool # (/=) :: Unifix -> Unifix -> Bool #
Show Unifix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods showsPrec :: Int -> Unifix -> ShowS # show :: Unifix -> String # showList :: [Unifix] -> ShowS #
PrecedenceOf Unifix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods precedence :: Unifix -> Precedence Source #

Type `Infix`

data Infix Source #

Constructors

Infix
Fields infix_associativity :: Maybe Associativity infix_precedence :: Precedence

Instances

Eq Infix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods (==) :: Infix -> Infix -> Bool # (/=) :: Infix -> Infix -> Bool #
Show Infix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods showsPrec :: Int -> Infix -> ShowS # show :: Infix -> String # showList :: [Infix] -> ShowS #
PrecedenceOf Infix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods precedence :: Infix -> Precedence Source #

infixL :: Precedence -> Infix Source #

infixR :: Precedence -> Infix Source #

infixB :: Side -> Precedence -> Infix Source #

infixN :: Precedence -> Infix Source #

infixN0 :: Infix Source #

infixN5 :: Infix Source #

isPairNeeded :: (Infix, Side) -> Infix -> Bool Source #

Given Precedence and Associativity of its parent operator, and the operand Side it is in, return whether an Infix operator needs to be enclosed by a Pair.

pairIfNeeded :: Semigroup s => IsString s => Pair -> (Infix, Side) -> Infix -> s -> s Source #

If isPairNeeded is True, enclose the given IsString by given Pair, otherwise returns the same IsString.

Type `Precedence`

type Precedence = Int Source #

Class `PrecedenceOf`

class PrecedenceOf a where Source #

Methods

precedence :: a -> Precedence Source #

Instances

PrecedenceOf Infix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods precedence :: Infix -> Precedence Source #
PrecedenceOf Unifix Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods precedence :: Unifix -> Precedence Source #
PrecedenceOf Fixity Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods precedence :: Fixity -> Precedence Source #

Type `Associativity`

data Associativity Source #

Constructors

AssocL	Associate to the left: `a ¹ b ² c == (a ¹ b) ² c`
AssocR	Associate to the right: `a ¹ b ² c == a ¹ (b ² c)`
AssocB Side	Associate to both sides, but to `Side` when reading.

Instances

Eq Associativity Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool #
Show Associativity Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS #

Type `Side`

data Side Source #

Constructors

SideL	Left
SideR	Right

Instances

Eq Side Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods (==) :: Side -> Side -> Bool # (/=) :: Side -> Side -> Bool #
Show Side Source #
Instance details Defined in Language.Symantic.Grammar.Fixity Methods showsPrec :: Int -> Side -> ShowS # show :: Side -> String # showList :: [Side] -> ShowS #

Type `Pair`

type Pair = (String, String) Source #

pairParen :: Pair Source #

pairBrace :: Pair Source #