From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.comp.tex.context/6017 Path: main.gmane.org!not-for-mail From: Marco Kuhlmann Newsgroups: gmane.comp.tex.context Subject: Re: How powerful is mp? Date: Wed, 7 Nov 2001 16:17:08 +0000 Sender: owner-ntg-context@let.uu.nl Message-ID: <20011107161708.A508@wimsey> References: <20011107123024.A3646@wimsey> <20011107165646.3a279f6a.taco@elvenkind.com> NNTP-Posting-Host: coloc-standby.netfonds.no Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: main.gmane.org 1035396569 6577 80.91.224.250 (23 Oct 2002 18:09:29 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Wed, 23 Oct 2002 18:09:29 +0000 (UTC) Cc: ntg-context@ntg.nl Original-To: Taco Hoekwater In-Reply-To: <20011107165646.3a279f6a.taco@elvenkind.com> Xref: main.gmane.org gmane.comp.tex.context:6017 X-Report-Spam: http://spam.gmane.org/gmane.comp.tex.context:6017 Hi Taco! Taco Hoekwater wrote (2001-11-07 (16:56)): > I just read the article. I must say that I am not overly > impressed with the presented algorithm, since it assumes all > leaf labels are of uniform width, thereby simplifying the task > at hand considerably. Yes, but it seems to be easy to generalise to different widths. The FMP implementation does this. > Anyway, of course it can be done in plain mp (or even in tex > itself). (nearly) everything that does not require a lot of > memory can be done in either language. ;) Ah, I had hoped for this! :-) I do not have a lot of experience in mp, and never saw any actual recursive algorithm implemented. > The mp toolkit that is called metaobj has rather nice support > for various kinds of trees, but it wouldnt be hard to roll > your own for this derived case either. The basic algorithm is > fairly simple. Thanks, I definitely shall have a more thorough look on it. Until now, I always thought that metaobj was just a wrapper for mp commands with "object" but no "member functions". Cheers, Marco -- Marco Kuhlmann marco.kuhlmann@gmx.net