Path: utzoo!attcan!uunet!cs.utexas.edu!sun-barr!olivea!mintaka!bloom-beacon!eru!hagbard!sunic!news.funet.fi!uta!kielo!av From: av@kielo.uta.fi (Arto V. Viitanen) Newsgroups: comp.lang.prolog Subject: Re: non-toy dcg grammar Message-ID: Date: 23 Oct 90 06:53:40 GMT References: <4633@rex.cs.tulane.edu> Sender: news@uta.fi Reply-To: av@uta.fi (Arto Viitanen) Organization: University of Tampere, Finland Lines: 22 Nntp-Posting-Host: uta.fi In-reply-to: rpg@rex.cs.tulane.edu's message of 22 Oct 90 23:05:02 GMT >>>>> On 22 Oct 90 23:05:02 GMT, rpg@rex.cs.tulane.edu (Robert Goldman) said: Robert> Do any of you have one of these which is in the public domain? I Robert> would like to give one out to students in my NLP class so that they Robert> can get experience with something realistic, rather than a neat toy Robert> system. Anything you could send would be much appreciated (a neat toy Robert> grammar with a large lexicon, e.g.). I am not sure, whether it is on public domain, but on Feliks Kluz'niak and Stanisl'aw Szpakowicz "Prolog for Programmers", Apic Studies in Data Processing No. 24 there is program called Toy-Sequel. Toy-Sequel is cut down version of SQL. It has queries, insert, updates, table creations and dumps/loads (to save the database). P.S. I just noticed: you said "non-toy dcg grammar" and program I suggest is called "Toy-Sequel", ... -- Arto V. Viitanen email: av@kielo.uta.fi University Of Tampere, av@ohdake.cs.uta.fi Finland