License | BSD-3-Clause |
---|---|
Maintainer | Jamie Willis |
Stability | experimental |
Safe Haskell | None |
Language | Haskell2010 |
Implements the analysis path required to determine how many tokens of input a given parser is known to consume at least in order to successfully execute. This provides the needed metadata to perform the piggybank algorithm in the machine (see Parsley.Internal.Backend.Machine.Types.Context for more information.)
Since: 1.5.0.0
Synopsis
- coinsNeeded :: Fix4 (Instr o) xs n r a -> Coins