Text.ParserCombinators.UU.Idioms

Documentation

data IF

Constructors

IF

Instances

Idiomatic st f g => Idiomatic st (a -> f) (IF -> Bool -> THEN -> P st a -> ELSE -> P st a -> FI -> g)

data THEN

Constructors

THEN

Instances

Idiomatic st f g => Idiomatic st (a -> f) (IF -> Bool -> THEN -> P st a -> ELSE -> P st a -> FI -> g)

data ELSE

Constructors

ELSE

Instances

Idiomatic st f g => Idiomatic st (a -> f) (IF -> Bool -> THEN -> P st a -> ELSE -> P st a -> FI -> g)

data FI

Constructors

FI

Instances

Idiomatic st f g => Idiomatic st (a -> f) (IF -> Bool -> THEN -> P st a -> ELSE -> P st a -> FI -> g)

data OR

Constructors

OR

data String'

Constructors

String'

Fields

fromStr :: String

data Ii

The Ii is to be pronounced as stop

Constructors

Ii

Instances

Idiomatic st x (Ii -> P st x)

iI :: Idiomatic i (a -> a) g => g

The function iI is to be pronounced as start

class Idiomatic st f g | g -> f st where

Methods

idiomatic :: P st f -> g

Instances

Idiomatic st x (Ii -> P st x)

Idiomatic st f g => Idiomatic st (a -> f) (IF -> Bool -> THEN -> P st a -> ELSE -> P st a -> FI -> g)

Idiomatic st f g => Idiomatic st ((a -> b) -> f) ((a -> b) -> g)

Idiomatic st f g => Idiomatic st (a -> f) (P st a -> g)

(Idiomatic (Str Char state loc) f g, IsLocationUpdatedBy loc Char, ListLike state Char) => Idiomatic (Str Char state loc) f (Char -> g)

(Idiomatic (Str Char state loc) f g, IsLocationUpdatedBy loc Char, ListLike state Char) => Idiomatic (Str Char state loc) f (String -> g)

pNat :: Parser Int

The idea of the Idiom concept is that sequential composition operators can be inferred from the type of the various operands

>>> run (iI (+) '(' pNatural "plus"  pNatural ')' Ii) "(2 plus 3"
  Result: 5
   Correcting steps: 
     Inserted  ')' at position LineColPos 0 4 4 expecting one of [')', Whitespace, '0'..'9']

show_demos :: IO ()