Fwd: solutions to an Excel XML processing problem

[Carl-Christian Kanne]

Dana,

I don't know what your definition of "simple" is, but here is a
"short" one without recursive functions:

for $i in 1 to /row/@cnt
let $b:=/row/c[position()=1 or @i <= $i][last()], $e:=$b/following::c[@i],
    $x:=($e,$e/following::c), $c:=($b,$b/following::c except $x)[1+$i
- $b/@i]/node()
return element c { $c }

best,
C-C