Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!mnetor!seismo!mcvax!enea!kuling!waldau From: waldau@kuling.UUCP (Mattias Waldau) Newsgroups: comp.lang.misc Subject: Re: Problems needed! Message-ID: <408@kuling.UUCP> Date: Fri, 3-Jul-87 19:13:23 EDT Article-I.D.: kuling.408 Posted: Fri Jul 3 19:13:23 1987 Date-Received: Sun, 5-Jul-87 06:35:39 EDT References: <9819@duke.cs.duke.edu> Reply-To: waldau@kuling.UUCP (Mattias Waldau) Organization: Dept. of Computer Systems, Uppsala University, Sweden Lines: 50 Newsgroups: comp.lang.misc Subject: Re: Problems needed! Summary: Expires: References: <9819@duke.cs.duke.edu> Sender: Reply-To: waldau@kuling.UUCP (Mattias Waldau) Followup-To: Distribution: Organization: Dept. of Computing Science, Uppsala University, Sweden Keywords: A problem that I have studied is representing a structure (PROLOG-term) or a complex list (LISP-term) as a tree. For example a(b(c),d(e,f)) as a | ---- | | b d | | | --- | | | c e f and a(b(c),david(e,f)) as a | ----- | | b david | | | --- | | | c e f In the first example determines c and e the structure of the tree, and in the second b and david. I am only interested in the absolut positions of the nodes and bars, not how the arcs are represented on the screen. The problem can be complicated by also restricting the width of the tree. I have made some programs in PROLOG and at last got a rather efficient and declarative solution, and if I took that solution and implemented it in LISP, I would get a lot of parameters and a program I wouldn't understand in 2 months time. I am very interested in other peoples solutions of this problem, so please mail them to me.