Discussion List Archives

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [ddlm-group] List/table recursion limits?

On 5/12/09 4:30 AM, "Joe Krahn" <krahn@niehs.nih.gov> wrote:

> It may be useful to put practical limits on recursion depth. Maybe 8 is
> sufficient? I suspect that most CIF developers want to keep nesting
> fairly shallow, given that CIF disallows and STAR loop nesting.

Is it necessary to apply a restriction to the recursive depth? As you say
humans will keep it fairly shallow anyway to keep things clear, but I can
foresee a machine generated data value being quite deep.

If I was to output as a CIF2 value (not that I would ever do this) the
entire internal representation of a domain dictionary category (and its
attributes), including methods and data file values, it would be a deeply
recursive compound data structure of significant complexity. But it would
all fit in a Table.



Associate Professor N. Spadaccini, PhD
School of Computer Science & Software Engineering

The University of Western Australia    t: +61 (0)8 6488 3452
35 Stirling Highway                    f: +61 (0)8 6488 1089
CRAWLEY, Perth,  WA  6009 AUSTRALIA   w3: www.csse.uwa.edu.au/~nick
MBDP  M002

CRICOS Provider Code: 00126G

e: Nick.Spadaccini@uwa.edu.au

ddlm-group mailing list

Reply to: [list | sender only]
International Union of Crystallography

Scientific Union Member of the International Science Council (admitted 1947). Member of CODATA, the ISC Committee on Data. Partner with UNESCO, the United Nations Educational, Scientific and Cultural Organization in the International Year of Crystallography 2014.

International Science Council Scientific Freedom Policy

The IUCr observes the basic policy of non-discrimination and affirms the right and freedom of scientists to associate in international scientific activity without regard to such factors as ethnic origin, religion, citizenship, language, political stance, gender, sex or age, in accordance with the Statutes of the International Council for Science.