Hi . I solved the “Wordy” exercise in Haskell using parsec. However, I have submitted 2 solns. First one, the parser checks only for positive or negative integers. Second solutions, simply excludes whitespace and “?”. Both ran successfully. I have a suggestion. Will it be possible to add a test case, where some of the numbers are in the form of “1249a” , and so on? SO that this fails? If it is alright, may I add this test case?
I initially posted this in the Haskell specific thread, but since it applies to the problem in general, I was recommended, posting it here.