Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [2 earlier articles] |
| Re: new language syntax 04lzvud73001@sneakemail.com (2001-08-25) |
| Re: new language syntax svdh@wanadoo.fr (2001-09-21) |
| Re: new language syntax howard.s.modell@boeing.com (HSM) (2001-09-25) |
| Re: new language syntax rboland@unb.ca (Ralph Boland) (2001-09-26) |
| Re: new language syntax joachim_d@gmx.de (Joachim Durchholz) (2001-10-06) |
| Re: new language syntax wclodius@aol.com (2001-10-20) |
| Re: new language syntax cfc@world.std.com (Chris F Clark) (2001-11-05) |
| From: | Chris F Clark <cfc@world.std.com> |
| Newsgroups: | comp.compilers |
| Date: | 5 Nov 2001 00:04:25 -0500 |
| Organization: | The World Public Access UNIX, Brookline, MA |
| References: | 01-10-019 01-10-103 |
| Keywords: | parse |
| Posted-Date: | 05 Nov 2001 00:04:25 EST |
William B. Clodius wrote:
> The extensions often allow grammars that aren't LR(k) for finite k,
> i.e., automatic treatment of the dangling ELSE problem.
The dangling ELSE problem can be solved in a LR(1) grammar, and also
in a LALR(1) or SLR(1) grammar. It requires no extensions to do so.
It cannot be solved in an LL(k) grammar (for any k) without extensions.
Perhaps, that is what you are thinking of.
Hope this helps,
-Chris
*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)
------------------------------------------------------------------------------
Return to the
comp.compilers page.
Search the
comp.compilers archives again.