How to convert Unicode Escape Sequence to Unicode String in Haskell

by

Prelude> putStrLn “\3619\3657\3634\3609\3648\3592\3657\3648\3621\3657\3591”
ร้านเจ้เล้ง

Note that you don’t actually have the string "\3619\3657\3634\3609\3648\3592\3657\3648\3621\3657\3591" – rather, you have the UTF-32 string ร้านเจ้เล้ง, for which "\3619\3657..." happens to be a ASCII-compliant literal. By default, GHCi uses the Show instance to display results, which doesn’t so much show things as spit out literals that can be used as Haskell code for the thing. It’s conservative in terms of unicode. That’s why

Prelude> “ร้านเจ้เล้ง”
“\3619\3657\3634\3609\3648\3592\3657\3648\3621\3657\3591”

On the other hand, the putStrLn, putChar, hPutStr etc. functions will just dump the string itself in UTF-8 rather than an ASCII-safe representation thereof.

If you’re actually reading the escaped string from a file or something, you can simply read it:

Prelude> s <‌- getLine
“\3619\3657\3634\3609\3648\3592\3657\3648\3621\3657\3591”
Prelude> s
“\”\\3619\\3657\\3634\\3609\\3648\\3592\\3657\\3648\\3621\\3657\\3591\””
— Note double escaping, because I’m showing a string that contains a string literal.
Prelude> putStrLn $ read s
ร้านเจ้เล้ง

More Related Contents:

  1. Haskell \p -> not takeWhile
  2. Sum of two numbers with function in haskell
  3. What is the monomorphism restriction?
  4. How to group similar items in a list using Haskell?
  5. When is memoization automatic in GHC Haskell?
  6. How do I deal with many levels of indentation?
  7. Memoization in Haskell?
  8. Wrong IO actions order using putStr and getLine
  9. Difference between `data` and `newtype` in Haskell
  10. How do functors work in haskell?
  11. double stream feed to prevent unneeded memoization?
  12. Lifting a higher order function in Haskell
  13. Currying subtraction
  14. Haskell: how to evaluate a String like “1+2”
  15. Why does haskell’s bind function take a function from non-monadic to monadic
  16. Difference between Monad and Applicative in Haskell
  17. Why is lazy evaluation useful?
  18. Using Maybe type in Haskell
  19. What is a monad?
  20. Why is there “data” and “newtype” in Haskell? [duplicate]
  21. Why are side-effects modeled as monads in Haskell?
  22. haskell running out of memory with finite lists
  23. Haskell – simple constructor comparison (?) function
  24. Comparing functions in Haskell
  25. Apostrophe in identifiers in Haskell
  26. Monoidal Functor is Applicative but where is the Monoid typeclass in the definition of Applicative?
  27. Haskell: Where vs. Let
  28. How does the ST monad work?
  29. An example of a Foldable which is not a Functor (or not Traversable)?
  30. Random number in Haskell [duplicate]

Leave a Comment