Glenn Cole wrote:

>(I tend to think of this as "circular calls" rather than recursion,
>but that may be just me.)

>I verified that this calling sequence (A->B->A) is supported 
>without warning of any kind, and it works just fine.

I rewrote the program to recursively perform a paragraph, and it 
worked just fine.  Now, paragraph A performs paragraph B, which 
may perform paragraph A again.  I haven't tried a case where 
A would perform B during the second perform, leading to a third 
perform of A.  The really hard part is keeping track of what 
chain you're traversing in the data set, and resetting the 
chain back to the original when you've finished the second 
chain.  I suppose you could table-ize the chain pointers so 
that a number of different levels of B-O-M could be traversed 
without difficulty (from the program's perspective, not the 
programmer's!).  Luckily we only have a three-tier (at most) 
B-O-M.

Thanks to all who responded.

Jim Phillips                            Manager of Information Systems
E-Mail: [log in to unmask]      Therm-O-Link, Inc.
Phone: (330) 527-2124                   P. O. Box 285
  Fax: (330) 527-2123                   Garrettsville, Ohio  44231