markh@csd4.milw.wisc.edu (Mark William Hopkins) (05/31/89)
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?