Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. Pos :: Int -> Pos

   flatparse	FlatParse.Common.Position

   No documentation available.

2. Path :: a -> [Word] -> !Trie' a -> Trie' a

   flatparse	FlatParse.Common.Switch

   No documentation available.

3. type Parser = Parser Error

   flatparse	FlatParse.Examples.BasicLambda.Lexer

   No documentation available.

4. Precise :: Pos -> Expected -> Error

   flatparse	FlatParse.Examples.BasicLambda.Lexer

   A precisely known error, like leaving out "in" from "let".

5. module FlatParse.Examples.BasicLambda.Parser

   This module contains a simple lambda calculus parser. This parser is not optimized for maximum performance; instead it's written in a style which emulates the look and feel of conventional monadic parsers. An optimized implementation would use low-level switch expressions more often.

6. type Parser = ParserT PureMode

   flatparse	FlatParse.Stateful

   The type of pure parsers.

7. type ParserIO = ParserT IOMode

   flatparse	FlatParse.Stateful

   The type of parsers which can embed IO actions.

8. type ParserST s = ParserT STMode s

   flatparse	FlatParse.Stateful

   The type of parsers which can embed ST actions.

9. newtype ParserT (st :: ZeroBitType) r e a

   flatparse	FlatParse.Stateful

   ParserT st r e a is a parser with a state token type st, a reader environment r, an error type e and a return type a. The different state token types support different embedded effects; see Parser, ParserIO and ParserST below.

10. ParserT :: (ForeignPtrContents -> r -> Addr# -> Addr# -> Int# -> st -> Res# st e a) -> ParserT (st :: ZeroBitType) r e a

    flatparse	FlatParse.Stateful

    No documentation available.

Page 500 of many | Previous | Next