Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Beginner help with LALR(1) closure kentr@rollinssoft.com (Kent Rollins) (1996-11-12) |
| Re: Beginner help with LALR(1) closure dlester@cs.man.ac.uk (1996-11-14) |
| Re: Beginner help with LALR(1) closure grout@sp55.csrd.uiuc.edu (1996-11-14) |
| Re: Beginner help with LALR(1) closure compres@world.std.com (1996-11-14) |
| Re: Beginner help with LALR(1) closure farzu@cs.tamu.edu (Francisco Arzu) (1996-11-14) |
| Re: Beginner help with LALR(1) closure adrian@dcs.rhbnc.ac.uk (1996-11-19) |
| Re: Beginner help with LALR(1) closure salomon@silver.cs.umanitoba.ca (1996-11-19) |
| Re: Beginner help with LALR(1) closure gianni@engr.sgi.com (Gianni Mariani) (1996-12-03) |
| Re: Beginner help with LALR(1) closure icedancer@ibm.net (1996-12-07) |
| Re: Beginner help with LALR(1) closure salomon@silver.cs.umanitoba.ca (1996-12-15) |
| From: | Gianni Mariani <gianni@engr.sgi.com> |
| Newsgroups: | comp.compilers |
| Date: | 3 Dec 1996 20:51:26 -0500 |
| Organization: | Silicon Graphics, Inc. |
| References: | 96-11-080 96-11-088 96-11-127 |
| Keywords: | parse, books |
Daniel J. Salomon wrote:
>
> Woa! That's a pretty heavy-duty reference for a beginner. Their
> method is more efficient than the ones given in the Dragon book, but
> quite complex to understand from their paper. If he really does want
> to do efficient generation of LALR(1) sets, he can check the shorter
> and clearer explanation of DeRemer and Pennello's paper in Tremblay &
> Sorenson "The Theory and Practice of Compiler Writing" McGraw Hill,
> 1985 page 375. I used this simplified description to teach the
> algorithm to my graduate students.
>
Do we care any more ? Are LR(1) tables so big that todays processors
are unable to deal with them effectivly ? (seem X lately ?).
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.