Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!uwm.edu!bionet!agate!darkstar!spica!kjell
From: kjell@spica.ucsc.edu (Kjell Post)
Newsgroups: comp.lang.prolog
Subject: Re: Prolog's Pitfalls?
Message-ID: <4938@darkstar.ucsc.edu>
Date: 6 Jul 90 10:19:49 GMT
References: <1990Jun18.221058.11331@chaos.cs.brandeis.edu> <4483@darkstar.ucsc.edu> <3293@goanna.cs.rmit.oz.au> <4518@darkstar.ucsc.edu> <10955@alice.UUCP> <4557@darkstar.ucsc.edu> <10965@alice.UUCP> <4646@darkstar.ucsc.edu> <31467@cup.portal.com>
Sender: usenet@darkstar.ucsc.edu
Reply-To: kjell@spica.ucsc.edu (Kjell Post)
Organization: University of California, Santa Cruz
Lines: 9

In article <31467@cup.portal.com> pgl@cup.portal.com (Peter G Ludemann) writes:
>There's another technique, which no-one seems to have mentioned:
>meta-grammar rules. 

I wrote an SLR(1)-parser generator last week (~250 Prolog-lines) and 
the associated LR-parser driver that goes with it (~20 lines).  I could
easily extend it to LALR(1) or STLR(1) if I need more power but right
now I'm just happy with the fact that I can use left-recursive grammars
again :-)