From owner-freebsd-chat Thu Dec 9 19:16:39 1999 Delivered-To: freebsd-chat@freebsd.org Received: from lariat.lariat.org (lariat.lariat.org [206.100.185.2]) by hub.freebsd.org (Postfix) with ESMTP id C745C153B3; Thu, 9 Dec 1999 19:16:33 -0800 (PST) (envelope-from brett@lariat.org) Received: from mustang (IDENT:ppp0.lariat.org@lariat.lariat.org [206.100.185.2]) by lariat.lariat.org (8.9.3/8.9.3) with ESMTP id UAA06442; Thu, 9 Dec 1999 20:14:25 -0700 (MST) Message-Id: <4.2.0.58.19991209200536.03b8b400@localhost> X-Sender: brett@localhost X-Mailer: QUALCOMM Windows Eudora Pro Version 4.2.0.58 Date: Thu, 09 Dec 1999 20:14:23 -0700 To: Roelof Osinga From: Brett Glass Subject: Re: Yahoo hacked last night Cc: David Scheidt , Tani Hosokawa , Jonathon McKitrick , Alfred Perlstein , Kris Kennaway , freebsd-chat In-Reply-To: <38503FAC.8926658E@nisser.com> References: <38502053.28737F7B@nisser.com> <4.2.0.58.19991209162117.00cc0670@localhost> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-freebsd-chat@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.org At 04:47 PM 12/9/1999 , Roelof Osinga wrote: >> Non-deterministic pattern matching and backward chaining languages are even > > more powerful (though dangerous in the wrong hands). SNOBOL and Prolog can > > both produce results that are surprising -- in a good way if you've > > programmed well; in a bad way otherwise. > >Well, have to disagree a bit. Prolog has depth-first search because >of efficiency, but it does mean it can miss solutions thus never >finish. If it's allowed to run to completion it will do a complete depth-first search and generate all possible solutions -- provided, of course, that the tree is finite. Much research has been done on rearranging Prolog rules so as to direct and speed up the search. >Barring Borland's Turbo Prolog most didn't have (past tense >since I didn't keep up) typechecking. Borland Turbo Prolog was based on Quintus Prolog. >Backward chaining doesn't ring a bell. Backward chaining is the mechanism of formal logic which Prolog implements. It tries to "chain" backward from a statement to the facts and rules which prove it to be true. >SNOBOL is truly ancient . Long since superceded by Icon. However, it still has some niceties that Icon doesn't. Regular expressions as implemented in Perl are far less potent than SNOBOL patterns. (The original SNOBOL book contains a complete parser for the SNOBOL language in SNOBOL; the set of patterns is only about 20 lines long. --Brett To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-chat" in the body of the message