[DFDL-WG] about recursive data structures

[Sampo Syreeni]

The DFDL spec has been growing quite a bit over the past two years or 
so. Mostly because of of the handling of arcane details. So...

Has it also grown in the wider, descriptive (complexity) sense? Can it 
now also describe e.g. the arbitrary link structure a typical *NIX file 
system image can contain, with its hard links?

If so, I might just now have an application for that. If not, why not? 
It isn't as though you can't develop clean semantics for that, if only 
as an option. And it's clearly warranted because formats utilizing such 
constructs constitute a sizable proportion of data both store and 
actively passed around.
-- 
Sampo Syreeni, aka decoy - decoy at iki.fi, http://decoy.iki.fi/front
+358-50-5756111, 025E D175 ABE5 027C 9494 EEB0 E090 8BA9 0509 85C2