Haskell: Parse error in pattern

by

You need some parenthesis:

mergeX [] b res = b ++ res
mergeX a [] res = a ++ res
mergeX (a:as) (b:bs) res
    | a > b     = mergeX as (b:bs) (a:res)
    | otherwise = mergeX (a:as) bs (b:res)

The reason is because : has a lower precedence than function application, so mergeX a:as b:bs res will be parsed as:

(mergeX a):(as b):(bs res)

which is an error.

More Related Contents:

  1. Pattern matching identical values
  2. Understanding the Haskell as-pattern
  3. Haskell GHC: what is the time complexity of a pattern match with N constructors?
  4. Can I match a data constructor wildcard in Haskell?
  5. Haskell: Given a list of numbers and a number k, return whether any two numbers from the list add up to k
  6. What is the monomorphism restriction?
  7. When is memoization automatic in GHC Haskell?
  8. How to get normal value from IO action in Haskell
  9. How do you represent a graph in Haskell?
  10. What does the exclamation mark mean in a Haskell declaration?
  11. Haskell: Lists, Arrays, Vectors, Sequences
  12. What are “n+k patterns” and why are they banned from Haskell 2010?
  13. How do I write, “if typeclass a, then a is also an instance of b by this definition.”
  14. Applicative functor evaluation is not clear to me
  15. Expressing do block using only monadic bind syntax
  16. Why do we need monads?
  17. What constitutes a fold for types other than list?
  18. How to make a CAF not a CAF in Haskell?
  19. Check whether a type is an instance of Show in Haskell at runtime?
  20. Integral operators quot vs. div
  21. How to interpret bind/>>= of the function instance?
  22. Why should Applicative be a superclass of Monad?
  23. Comparing Haskell’s Snap and Yesod web frameworks
  24. functions as applicative functors (Haskell / LYAH)
  25. how to implement doubly linked lists
  26. How does Data.MemoCombinators work?
  27. How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)?
  28. Is there a built-in function to get all consecutive subsequences of size n of a list in Haskell?
  29. ‘some’ and ‘many’ functions from the ‘Alternative’ type class [duplicate]
  30. Sampling sequences of random numbers in Haskell

Leave a Comment