computer-go: sgf tree structure peculiarity

[Ray Tayek <rtayek@xxxxxxxxx>]

hi, writing an sgf parser. normally i would expect that variations would be 
in a subtree (i.e the "down" link in a node). but looking at the simple 
example at http://www.red-bean.com/sgf/sgf4.html (see below) , it looks 
like they want the *first* variation to be linked on the "next" link. it 
looks like this could be accomplished by a second pass over the tree, by 
looking for nodes that have a "next" link of null and a "down" link 
non-null and swapping the two links.

has anyone else ran across this? (or perhaps i am confused?)

thanks

(;FF[4]C[root](;C[a];C[b](;C[c])
(;C[d];C[e]))
(;C[f](;C[g];C[h];C[i])
(;C[j])))

---
ray tayek http://home.attbi.com/~rtayek/ actively seeking telecommuting work
vice chair orange county java users group http://www.ocjug.org/ 
mailto:chair@xxxxxxxxxxxxxxxxx
hate spam? http://samspade.org/ssw/