ADP.Fusion.Term.Chr.Type

TODO Rename Chr to Vtx, a vertex parser is a generalization of a char parser. But this is only semantics, so not super important to do now.

Documentation

data Chr r x where

A generic Character parser that reads a single character but allows passing additional information.

Chr expects a function to retrieve r at index position, followed by the actual generic vector with data.

Constructors

Chr :: Vector v x => (v x -> Int -> r) -> !(v x) -> Chr r x

Instances

(Show i, Show (RunningIndex i), Show r, Show (Elm ls i)) => Show (Elm ((:!:) ls (Chr r x)) i)

Methods

showsPrec :: Int -> Elm (ls :!: Chr r x) i -> ShowS

show :: Elm (ls :!: Chr r x) i -> String

showList :: [Elm (ls :!: Chr r x) i] -> ShowS

Build (Chr r x)

Associated Types

type Stack (Chr r x) :: *

Methods

build :: Chr r x -> Stack (Chr r x)

Element ls i => Element ((:!:) ls (Chr r x)) i

Associated Types

data Elm ((:!:) ls (Chr r x)) i :: *

type RecElm ((:!:) ls (Chr r x)) i :: *

type Arg ((:!:) ls (Chr r x)) :: *

Methods

getArg :: Elm (ls :!: Chr r x) i -> Arg (ls :!: Chr r x)

getIdx :: Elm (ls :!: Chr r x) i -> RunningIndex i

getElm :: Elm (ls :!: Chr r x) i -> RecElm (ls :!: Chr r x) i

type Stack (Chr r x)

type Stack (Chr r x) = (:!:) S (Chr r x)

data Elm ((:!:) ls (Chr r x))

data Elm ((:!:) ls (Chr r x)) = ElmChr !r !(RunningIndex i) !(Elm ls i)

type Arg ((:!:) ls (Chr r x))

type Arg ((:!:) ls (Chr r x)) = (:.) (Arg ls) r

type TermArg (Chr r x)

type TermArg (Chr r x) = r

chr :: Vector v x => v x -> Chr x x

smart constructor for regular 1-character parsers

chrLeft :: Vector v t => v t -> Chr (Maybe t, t) t

Smart constructor for Maybe Peeking, followed by a character.