Re: Storing data and code in a Db with LISP-like interface

From: Neo <neo55592_at_hotmail.com>
Date: 31 Mar 2006 09:37:36 -0800
Message-ID: <1143826656.471435.258720_at_z34g2000cwc.googlegroups.com>


> ... your so-called analogy is not an analogy. Had it involved a large,
> truck-mounted, diesel-powered hydraulic-actuated wrench,
> requiring a skilled specialist operator and a maintenance budget that
> would make the military blush, it would have been much more apt.

:) Yes, you are correct in that when initially seeing a monotonous interface having the structure "(func par1 par2 ...)" where any element (function or parameter) within the parentheses can itself have a similar structure, and so on forever, it must seem like "a large, truck-mounted, diesel-powered hydraulic-actuated wrench, requiring a skilled specialist operator ...". However, I assert the reverse is true for the problem presented. To prove or disprove this assertion, I need you (or anyone else) to post an equivalent solution using your preferred tool.

Breifly stated, create a function that given a hierarchy and a thing in the hierarchy returns the root. Not only should the function work for data entered prior to writing the function but also for new data entered after the function is written. I have already posted a solution using the experimental db with a LISP-like interface (which is in its embryonic stage of development). Please post your solution so that we can make a comparison. Received on Fri Mar 31 2006 - 19:37:36 CEST

Original text of this message