Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!markh
From: markh@csd4.milw.wisc.edu (Mark William Hopkins)
Newsgroups: comp.lang.prolog
Subject: The inverse problem -- Compiling Prolog with a parser generator.
Message-ID: <2690@csd4.milw.wisc.edu>
Date: 31 May 89 01:09:26 GMT
References: <268@ucl-cs.UUCP>
Sender: news@csd4.milw.wisc.edu
Reply-To: markh@csd4.milw.wisc.edu (Mark William Hopkins)
Organization: University of Wisconsin-Milwaukee
Lines: 9

In article <268@ucl-cs.UUCP> R.Kassem@ucl-cs.UUCP writes:
>From: Rabih Kassem <R.Kassem@uk.ac.ucl.cs>
>
>Does anyone know of an interpreter for Augmented Transitions
>Networks (ATN) which is written in Prolog?

On the other hand, does anyone know of a compiler for Prolog that treats
a Prolog program as a augmented context-free grammar and generates a parser
for it, say, based on (non-deterministic) LR(k) parsing techniques?