Re: LALR(1) Lookahead calculation

corbett@lupa.Eng.Sun.COM (Robert Corbett)
24 Sep 1998 00:19:07 -0400

          From comp.compilers
Related articles
LALR(1) Lookahead calculation chrish@3drealms.com (1998-09-18)
Re: LALR(1) Lookahead calculation cfc@world.std.com (Chris F Clark) (1998-09-22)
Re: LALR(1) Lookahead calculation sperber@informatik.uni-tuebingen.de (1998-09-22)
Re: LALR(1) Lookahead calculation corbett@lupa.Eng.Sun.COM (1998-09-24)
Re: LALR(1) Lookahead calculation dick@cs.vu.nl (1998-09-26)
Re: LALR(1) Lookahead calculation cfc@world.std.com (Chris F Clark) (1998-09-26)
| List of all articles for this month |
From: corbett@lupa.Eng.Sun.COM (Robert Corbett)
Newsgroups: comp.compilers
Date: 24 Sep 1998 00:19:07 -0400
Organization: Sun Microsystems Computer Corporation
References: 98-09-069 98-09-088
Keywords: LR(1), parse

Chris F Clark <cfc@world.std.com> wrote:
>> Right now the generator is LR(0) . . . adapting it to calculate the
>> lookahead tokens required for LALR(1) . . . is there a more simplistic
>> alternative to these algorithms?
>
>Yes, find David Spector's paper on "state splitting".


State splitting is not a way of computing LALR(1) lookahead sets.
State splitting is a way of producing an LR(1) parser from a parser
based on the LR(0) state set.


State splitting is very hard. I have read several papers purporting
to describe state splitting algorithms. The only one I have seen that
I believe to be correct is the paper "A Practical State Splitting
Algorithm for Constructing LR-Parsers" by Kristensen and Madsen
published by Aarhus University.


Sincerely,
Bob Corbett
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.