Symparsec.Example.Expr

Experiments.

Turns out we can't write recursive parsers. But Apply can help us write handier parsers.

Documentation

data Expr

Constructors

ELit Lit

EBOp Expr BOp Expr

data BOp

Constructors

Plus

data Lit

Constructors

LNat Natural

type PLit = PLNat

type PLNat = Con1 LNat :<$>: While IsHexDigitSym NatHex

type PELit = Con1 ELit :<$>: PLit

type PEBOp = Curry3Sym (Con3 EBOp) :<$>: ((PExpr :<*>: PBOp) :<*>: PExpr)

type PExpr = PELit

type PBOp = ConstSym1 Plus :<$>: Literal "+"

data Curry3Sym f abc

Instances

type App (Curry3Sym f :: FunKind ((a1, a2), a3) k -> Type) ('('(a4, b), c) :: ((a1, a2), a3))

Defined in Symparsec.Example.Expr

type App (Curry3Sym f :: FunKind ((a1, a2), a3) k -> Type) ('('(a4, b), c) :: ((a1, a2), a3)) = ((f @@ a4) @@ b) @@ c

type family FromEither eaa where ...

Equations

FromEither (Right a) = a

FromEither (Left a) = a

data FromEitherSym eaa

Instances

type App (FromEitherSym :: FunKind (Either a a) a -> Type) (eaa :: Either a a)

Defined in Symparsec.Example.Expr

type App (FromEitherSym :: FunKind (Either a a) a -> Type) (eaa :: Either a a) = FromEither eaa