Related articles |
---|
[11 earlier articles] |
Re: LL(1) vs LALR(1) parsers ddean@dynastar.cs.princeton.edu (1995-11-28) |
Re: LL(1) vs LALR(1) parsers napi@ms.mimos.my (1995-11-28) |
Re: LL(1) vs LALR(1) parsers ok@cs.rmit.edu.au (1995-11-29) |
Re: LL(1) vs LALR(1) parsers mparks@oz.net (1995-11-29) |
Re: LL(1) vs LALR(1) parsers jmccarty@spdmail.spd.dsccc.com (1995-11-29) |
Re: LL(1) vs LALR(1) parsers pardo@cs.washington.edu (1995-11-29) |
Re: LL(1) vs LALR(1) parsers CSPT@giraffe.ru.ac.za (Pat Terry) (1995-11-30) |
Re: LL(1) vs LALR(1) parsers gvcormac@plg.uwaterloo.ca (Gord Cormack) (1995-12-01) |
Re: LL(1) vs LALR(1) parsers bridges@cs.arizona.edu (1995-12-01) |
Re: LL(1) vs LALR(1) parsers mparks@oz.net (1995-12-09) |
Re: LL(1) vs LALR(1) parsers maatwerk@euronet.nl (1995-12-09) |
Re: LL(1) vs LALR(1) parsers sperber@informatik.uni-tuebingen.de (Michael Sperber [Mr. Preprocessor]) (1995-12-09) |
Re: LL(1) vs LALR(1) parsers mparks@oz.net (1995-12-12) |
[4 later articles] |
Newsgroups: | comp.compilers |
From: | "Pat Terry" <CSPT@giraffe.ru.ac.za> |
Keywords: | parse, LALR, LL(1) |
Organization: | Rhodes University |
References: | 95-11-051 95-11-234 |
Date: | Thu, 30 Nov 1995 12:30:09 GMT |
Richard O'Keefe writes (ok.cs.rmit.edu.au)
> Yacc was wonderful for a PDP-11. I have encouraged several bright students
> to use it in projects, and every time it has taken them a long time to
> learn how to use it.
[snip]
> That's why I've reverted to writing recursive descent parsers.
[snip]
> I KNOW YACC. It seems to take _bright_ students >10 hours to learn how to
> use Yacc in a basic sort of way.
[snip - call for someone to evaluate various generators]
We have found that students can get up and running with Coco/R in a very short
time. It's definitely worth a look if you're teaching beginners. And you
can get C, Oberon, Pascal or Modula versions.
Pat Terry, Computer Science, Rhodes University, GRAHAMSTOWN 6140, RSA
cspt@cs.ru.ac.za or cspt@giraffe.ru.ac.za or pdterry@psg.com
Voice +27-461-318291 or +27-461-318292 FAX +27-461-25049
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.