|
| Agda.Syntax.Concrete.Operators.Parser |
|
|
|
|
|
| Synopsis |
|
| | | class HasRange e => IsExpr e where | | | | recursive :: (ReadP tok a -> [ReadP tok a -> ReadP tok a]) -> ReadP tok a | | | chainr1' :: ReadP t a -> ReadP t (a -> a -> ReadP t a) -> ReadP t a | | | chainl1' :: ReadP t a -> ReadP t (a -> a -> ReadP t a) -> ReadP t a | | | partP :: IsExpr e => String -> ReadP e (Range, 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]) | | | rebuild :: forall a e. IsExpr e => NewNotation -> Range -> [e] -> ReadP a e | | | 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 | | | 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 |
|
|
| Documentation |
|
|
|
|
|
|
|
| Parser combinators
|
|
|
| Combining a hierarchy of parsers.
|
|
|
| Variant of chainr1
|
|
|
| Variant of chainl1
|
|
|
| Parse a specific identifier as a NamePart
|
|
|
|
|
|
|
|
|
| Parse the operator part of the given syntax.
holes at beginning and end are IGNORED.
|
|
|
| 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)
|
|
|
|
|
|
|
| Parse using the appropriate fixity, given a parser parsing the
operator part, the name of the operator, and a parser of
subexpressions.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Produced by Haddock version 2.6.1 |