Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site ucla-cs.ARPA
Path: utzoo!linus!decvax!ittvax!dcdwest!sdcsvax!sdcrdcf!trwrba!cepu!ucla-cs!srt
From: srt@ucla-cs.UUCP
Newsgroups: net.lang.prolog
Subject: Need Prolog Parser
Message-ID: <1473@ucla-cs.ARPA>
Date: Wed, 3-Oct-84 14:46:20 EDT
Article-I.D.: ucla-cs.1473
Posted: Wed Oct  3 14:46:20 1984
Date-Received: Fri, 5-Oct-84 20:11:30 EDT
Organization: UCLA CS Dept.
Lines: 24

I'm trying to fix a prolog-in-lisp that is being built here at UCLA (in
T).  The main problem is the parser.  It only accepts a subset of Prolog,
and it cannot handle declared operators, a feature which I badly need.

So I'm looking for a Prolog parser written either in Lisp or Prolog.  It
needs to be able to handle operators.  I don't care too much what the
output looks like.  Our current parser takes

		john(X) :- pete(X), joe(X).

and returns

		(:- (john (*var* x)) (pete (*var* x)) (joe (*var* x)))

which is then shunted off to the interpreter.  I'm willing to put some
effort into converting your parser to my needs, so if you have something
that might be useful, I'd appreciate receiving it.  Thanks in advance!

    Scott R. Turner
    UCLA Computer Science Department
    3531 Boelter Hall, Los Angeles, CA 90024
    ARPA:  srt@UCLA-LOCUS.ARPA
    UUCP:  ...!{cepu,ihnp4,trwspp,ucbvax}!ucla-cs!srt