Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| LALR look-ahead sets from item right context grammar? rprogers@seanet.com (Richard Rogers) (2026-01-29) |
| LALR look-ahead sets from item right context grammar? cclark@imachinesinc.com (Chris Clark) (2026-01-31) |
| LALR look-ahead sets from item right context grammar? rprogers@seanet.com (Richard Rogers) (2026-02-07) |
| From: | Chris Clark <cclark@imachinesinc.com> |
| Newsgroups: | comp.compilers |
| Date: | Sat, 31 Jan 2026 01:30:19 +0000 |
| Organization: | Compilers Central |
| References: | 26-01-005 |
| Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="10283"; mail-complaints-to="abuse@iecc.com" |
| Keywords: | parse, LALR |
| Posted-Date: | 31 Jan 2026 17:45:55 EST |
While I haven't read the book you reference, and thus am not familiar with the
details of the "right context grammar", I would suggest you look to verify
that in cases where there are nullable non-terminals in the right context
grammar, that it would also include the "follow" set and not just the "first'
set. We did something similar to that in our version of "Yacc++ and the
Language Objects Library" but our algorithm is a non-standard implementation
of the technology. Still the LR(0) machine has more information in it than is
generally assumed.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.