[Haskell-beginners] Given a list of lists, how to drop the last item in each (sub)list.

[Angus Comber]

I have a list like this:

[[1,0,0,0,1,1,1,0,0],[1,1,1,0,1,1,1,0,0],[1,0,1,0,0,1,1,0,0],[0,1,0,0,1,1,1,0,0],[0,0,1,0,1,1,1,0,0],[1,0,0,1,1,1,1,0,1]]

The 'inner' list is a list of 9 items.  I want to process the list so that
a list of lists is returned but the 9th element in each inner list is
dropped.

So the function type would be [[a]] -> [[a]]

So to get started I wrote a function like this:

discardparitybyte :: [[Bit]] -> [[Bit]]

But then not sure how to transform the inner list.

I know I can access the first inner element using take 1 list.  But how do
I then access/manipulate this inner list?

discardparitybyte (x:xs) = take 9 ??? (take 1 xs) : discardparitybyte ???
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20140102/02343f1f/attachment.html>