Agda.Syntax.Concrete.Operators.Parser

Documentation

data ExprView e

Constructors

LocalV Name

OtherV e

AppV e (NamedArg e)

OpAppV Name [e]

HiddenArgV (Named String e)

LamV [LamBinding] e

ParenV e

class HasRange e => IsExpr e where

Methods

exprView :: e -> ExprView e

unExprView :: ExprView e -> e

Instances

IsExpr Pattern

IsExpr Expr

Parser combinators

recursive :: (ReadP tok a -> [ReadP tok a -> ReadP tok a]) -> ReadP tok a

Combining a hierarchy of parsers.

chainr1' :: ReadP t a -> ReadP t (a -> a -> ReadP t a) -> ReadP t a

Variant of chainr1

chainl1' :: ReadP t a -> ReadP t (a -> a -> ReadP t a) -> ReadP t a

Variant of chainl1

partP :: IsExpr e => String -> ReadP e (Range, NamePart)

Parse a specific identifier as a NamePart

binop :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e (e -> e -> ReadP a e)

postop :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e (e -> ReadP a e)

preop :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e (e -> ReadP a e)

opP :: IsExpr e => ReadP e e -> NewNotation -> ReadP e (NewNotation, Range, [e])

Parse the operator part of the given syntax. holes at beginning and end are IGNORED.

rebuild :: forall a e. IsExpr e => NewNotation -> Range -> [e] -> ReadP a e

Given a name with a syntax spec, and a list of parsed expressions fitting it, rebuild the expression. Note that this function must not parse any input (as guaranteed by the type)

rebuildBinding :: ExprView e -> ReadP a LamBinding

($$$) :: (e -> ReadP a e) -> ReadP a e -> ReadP a e

infixrP :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e e -> ReadP e e

Parse using the appropriate fixity, given a parser parsing the operator part, the name of the operator, and a parser of subexpressions.

infixlP :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e e -> ReadP e e

postfixP :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e e -> ReadP e e

prefixP :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e e -> ReadP e e

nonfixP :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e e -> ReadP e e

infixP :: IsExpr e => ReadP e (NewNotation, Range, [e]) -> ReadP e e -> ReadP e e

appP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e e

atomP :: IsExpr e => (Name -> Bool) -> ReadP e e