Toy Problem of the Week

I was raking around on the net and found this problem and coded up a solution. Once we get at least 10 solutions I'll post mine and a link to where I found the problem.
Any language, any libraries (but declare them) allowed. Aim for clarity and conciseness. Assume the input is well formed. Mine is 5 lines of scheme code (6 if we include requiring a library). No calling an "answer" function that "you wrote already and put in an external lib" ;)

Consider the problem of turning a list consisting
of a mix between symbols and non-symbols into a
list of lists of the symbol and its following
non-symbols. That is:

Input:    ({<symbol> <non-symbol>*} ... )
Output:   ((<symbol> (<non-symbol>*)) ...)
Example:     (a 1 2 3 b 4 5 c d 8 9 e)
           -> ((a (1 2 3)) (b (4 5)) (c ()) (d (8 9)) (e ()))

This is my first non-trivial algorithm in F#. Gosh, this is hard.

let rec splitlist l along =   

    let rec gather l =
        match l with
            |[] -> []
            |head::tail when (head<>along) -> head::(gather tail)
            |head::tail -> []

    match l with
        |[] -> []
        |head::tail when (head=along) -> (head::(gather tail))::(splitlist tail along)           
        |head::tail -> (splitlist tail along)
       
       
let separate l along=
    (splitlist l along) |> Seq.map (fun x -> match x with |head::tail -> (head ,tail))