parsley-core-1.6.0.0: A fast parser combinator library backed by Typed Template Haskell
LicenseBSD-3-Clause
MaintainerJamie Willis
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Parsley.Internal.Backend.Analysis.Coins

Description

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

Documentation

coinsNeeded :: Fix4 (Instr o) xs n r a -> Coins Source #

Calculate the number of tokens that will be consumed by a given machine.

Since: 1.5.0.0