| Related articles |
|---|
| LR(k)-Parser wanted holzmuel@kafka.informatik.uni-stuttgart.de (1995-04-21) |
| Re: LR(k)-Parser wanted rekers@wi.leidenuniv.nl (1995-04-29) |
| Re: LR(k)-Parser wanted grosch@cocolab.sub.com (1995-04-25) |
| Re: LR(k)-Parser wanted parrt@parr-research.com (Terence John Parr) (1995-04-30) |
| Re: LR(k)-Parser wanted cisreb@cis.unisa.edu.au (Bob Buckley) (1995-05-11) |
| Re: LR(k)-Parser wanted grosch@cocolab.sub.com (1995-06-05) |
| Newsgroups: | comp.compilers |
| From: | holzmuel@kafka.informatik.uni-stuttgart.de (Bernd Holzmueller) |
| Keywords: | parse, question, comment |
| Organization: | Computer Science Department; University of Stuttgart |
| Date: | Fri, 21 Apr 1995 16:07:50 GMT |
Has anybody developed a parser-generator which generates parsers for the
grammar class of LR(1), LR(k) for a fixed k > 1 or LR(k) for arbitrary k?
Any links would be very appreciated.
Bernd
--
Bernd Holzmueller Breitwiesenstrasse 20-22
Programming Language Group 70565 Stuttgart, Germany
Computer Science Department Phone: +49 711-7816-375
University of Stuttgart, Germany Fax: +49 711-7816-380
email: holzmuel@informatik.uni-stuttgart.de
[In theory LR(1) is all you need, but there are certainly grammars more
easily expressed as LR(2) or higher than as LR(1). -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.