class Applicative f => Alternative f
base Control.Applicative
A monoid on applicative functors. Minimal complete definition: empty and <|>. some and many should be the least solutions of the equations: * ome v = (:) <$> v <*> many * any v = some v <|> pure  
alternative :: Lex a v -> Lex a (Lex a v)
haskell-src Language.Haskell.ParseMonad
package alternative-io
This package is deprecated, Please use io-choice. Version 0.0.1