Awk makes it trivially easy to parse text. How does Haskell handle this parsing task? I am curious because I've always wanted to learn Haskell, mainly because of its lazy evaluation, but hadn't had the time yet. Hope to do it soon.
That said: strings are lists of chars, and Haskell is strong at pattern matching (esp within lists) in a bunch of different ways, so trivial text parsing tasks are trivial and intuitive in Haskell. For anything slightly more complex, there are regular expression and enumerating libraries which can do the job alright (and efficiently if I may say so).
EDIT: I'm sorry, can you give me an example of a problem so I can give you an example of a solution? :-)