Agda-2.2.6: A dependently typed functional programming language and proof assistant

Agda.Syntax.Concrete.Operators.Parser

Contents

Synopsis

Documentation

data ExprView e Source

Constructors

LocalV Name 
OtherV e 
AppV e (NamedArg e) 
OpAppV Name [e] 
HiddenArgV (Named String e) 
ParenV e 

Instances

Show e => Show (ExprView e) 

class HasRange e => IsExpr e whereSource

Parser combinators

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

Combining a hierarchy of parsers.

binop :: IsExpr e => ReadP e e -> ReadP e (e -> e -> e)Source

preop :: IsExpr e => ReadP e e -> ReadP e (e -> e)Source

postop :: IsExpr e => ReadP e e -> ReadP e (e -> e)Source

opP :: IsExpr e => ReadP e e -> Name -> ReadP e eSource

prefixP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e eSource

postfixP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e eSource

infixrP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e eSource

infixlP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e eSource

infixP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e eSource

nonfixP :: IsExpr e => ReadP e e -> ReadP e e -> ReadP e eSource

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

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