RE: Recursive data structures
Yes. When I had some input to the IETM db spec Bryan Caporlette designed, I set the SGML Declaration to limit the recursion depth. It was arbitrary on my part but every now an then, someone would use a system tag to get down to switches and it was a "who cares" situation, or the mapping from the source relational db was funky and again, it went very deep. I used to count the indentation number and use it as a rough estimate of system complexity. Don't go there. It is a portal to hell. ;-) len -----Original Message----- From: Gavin Thomas Nicol [mailto:gtn@r...] On Thursday 17 January 2002 09:38 am, Bullard, Claude L (Len) wrote: > But any tool > that will select/match a nest is a good idea beyond > eyeballing it because any recursing element will > make you curse right along with it. Interestingly, most DTD's, and certainly most instances, have markup depths of no more than 8 levels or so (often 3 to 5). I think this is becaus people have a natural limit of stacking, and anything more results in "stack overflow, brain dumped" problems. The deepest (I think) I ever saw for constrained (ie. required) nesting was the MILSPEC stuff.
PURCHASE STYLUS STUDIO ONLINE TODAY!
Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!
Download The World's Best XML IDE!
Accelerate XML development with our award-winning XML IDE - Download a free trial today!
Subscribe in XML format