Re: [Haskell-cafe] [Parsec] A combinator to match between M and N times?

Chris Kuklewicz wrote:

Again, Parsec requires you to put "try" where you need it

I'm pretty sure it does, although this

Udo Stenzel wrote:

...

countBetween 0 n p = p <:> countBetween 0 (n-1) p <|> return []

is a place where it's not needed in general. You should know what you're doing, though. And I like ReadP better in general, exactly because 'try' is a bit trippy. Udo. -- C'est magnifique, mais ce n'est pas l'Informatique. -- Bosquet [on seeing the IBM 4341]