Copyright	(C) 2017-18 Jakub Daniel
License	BSD-style (see the file LICENSE)
Maintainer	Jakub Daniel <jakub.daniel@protonmail.com>
Stability	experimental
Safe Haskell	None
Language	Haskell2010

Data.Expression.Parser

Description

Synopsis

type Context = Map String DynamicSort
type Parser = ReaderT Context (StateT Context Parser)
class Parseable f g where
- parser :: Proxy f -> Parser (DynamicallySortedFix g) -> Parser (DynamicallySortedFix g)
parse :: forall f (s :: Sort). (Parseable f f, SingI s) => Text -> Maybe (IFix f s)
parseWith :: forall f (s :: Sort). (Parseable f f, SingI s) => Context -> Text -> Maybe (IFix f s)
char :: Char -> Parser Char
choice :: [Parser a] -> Parser a
decimal :: Parser Int
digit :: Parser Char
letter :: Parser Char
many1 :: Parser a -> Parser [a]
sepBy1 :: Parser a -> Parser s -> Parser [a]
signed :: Parser Int -> Parser Int
space :: Parser Char
string :: Text -> Parser Text
identifier :: Parser String
(<?>) :: Parser a -> String -> Parser a
assertSort :: String -> DynamicSort -> Parser ()
assumeSort :: String -> Parser DynamicSort

Documentation

type Context = Map String DynamicSort Source #

Parsing context assigning sorts to known variables

type Parser = ReaderT Context (StateT Context Parser) Source #

Context-sensitive parser that remembers sorts of variables

class Parseable f g where Source #

Expressions that can be parsed

Methods

parser :: Proxy f -> Parser (DynamicallySortedFix g) -> Parser (DynamicallySortedFix g) Source #

Instances

IfThenElseF :<: f => Parseable IfThenElseF f Source #
Instance details Defined in Data.Expression.IfThenElse Methods parser :: Proxy IfThenElseF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
ArrayF :<: f => Parseable ArrayF f Source #
Instance details Defined in Data.Expression.Array Methods parser :: Proxy ArrayF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
ArithmeticF :<: f => Parseable ArithmeticF f Source #
Instance details Defined in Data.Expression.Arithmetic Methods parser :: Proxy ArithmeticF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
NegationF :<: f => Parseable NegationF f Source #
Instance details Defined in Data.Expression Methods parser :: Proxy NegationF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
DisjunctionF :<: f => Parseable DisjunctionF f Source #
Instance details Defined in Data.Expression Methods parser :: Proxy DisjunctionF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
ConjunctionF :<: f => Parseable ConjunctionF f Source #
Instance details Defined in Data.Expression Methods parser :: Proxy ConjunctionF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
(EqualityF :: (Sort -> Type) -> Sort -> Type) :<: f => Parseable (EqualityF :: (k -> Type) -> Sort -> Type) f Source #
Instance details Defined in Data.Expression.Equality Methods parser :: Proxy EqualityF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
(ExistentialF v :<: f, SingI v) => Parseable (ExistentialF v :: (Sort -> Type) -> Sort -> Type) f Source #
Instance details Defined in Data.Expression Methods parser :: Proxy (ExistentialF v) -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
(UniversalF v :<: f, SingI v) => Parseable (UniversalF v :: (Sort -> Type) -> Sort -> Type) f Source #
Instance details Defined in Data.Expression Methods parser :: Proxy (UniversalF v) -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
(VarF :: (Sort -> Type) -> Sort -> Type) :<: f => Parseable (VarF :: k -> Sort -> Type) f Source #
Instance details Defined in Data.Expression Methods parser :: Proxy VarF -> Parser (DynamicallySortedFix f) -> Parser (DynamicallySortedFix f) Source #
(Parseable f h, Parseable g h) => Parseable (f :+: g :: k1 -> k2 -> Type) h Source #
Instance details Defined in Data.Expression.Parser Methods parser :: Proxy (f :+: g) -> Parser (DynamicallySortedFix h) -> Parser (DynamicallySortedFix h) Source #

parse :: forall f (s :: Sort). (Parseable f f, SingI s) => Text -> Maybe (IFix f s) Source #

Tries to parse the entire input text and produce an expression in desired language and with desired sort.

parseWith :: forall f (s :: Sort). (Parseable f f, SingI s) => Context -> Text -> Maybe (IFix f s) Source #

Like parse but allows adding initial assumption about sorts of some variables.

char :: Char -> Parser Char Source #

Matches a given character.

choice :: [Parser a] -> Parser a Source #

Matches first of many choices.

decimal :: Parser Int Source #

Matches a given decimal number.

digit :: Parser Char Source #

Matches a given digit.

letter :: Parser Char Source #

Matches any character.

many1 :: Parser a -> Parser [a] Source #

Matches one or more times.

sepBy1 :: Parser a -> Parser s -> Parser [a] Source #

Matches one or more times, separated by specified separator.

signed :: Parser Int -> Parser Int Source #

Matches a signed number.

space :: Parser Char Source #

Matches space.

string :: Text -> Parser Text Source #

Matches a given string.

identifier :: Parser String Source #

Matches identifier that starts with [a-zA-Z'_#] and is followed by [a-zA-Z'_#0-9].

(<?>) :: Parser a -> String -> Parser a Source #

Labels parser.

assertSort :: String -> DynamicSort -> Parser () Source #

Asserts what sort is assigned to a variable in current context.

assumeSort :: String -> Parser DynamicSort Source #

Variable assumes sort based on current context.