Re: Looking for formal definition of LALR(k)

Ziemowit Laski <laski@ics.uci.edu>
22 Oct 1998 02:01:08 -0400

          From comp.compilers
Related articles
Looking for formal definition of LALR(k) laski@ics.uci.edu (Ziemowit Laski) (1998-10-17)
Re:Looking for formal definition of LALR(k) KPRASAD@us.oracle.com (KPRASAD.US.ORACLE.COM) (1998-10-21)
Re: Looking for formal definition of LALR(k) matt@timmermans.no-spam-remove.org (Matt Timmermans) (1998-10-22)
Re: Looking for formal definition of LALR(k) laski@ics.uci.edu (Ziemowit Laski) (1998-10-22)
Re: Looking for formal definition of LALR(k) laski@ics.uci.edu (Ziemowit Laski) (1998-10-24)
| List of all articles for this month |
From: Ziemowit Laski <laski@ics.uci.edu>
Newsgroups: comp.compilers
Date: 22 Oct 1998 02:01:08 -0400
Organization: Compilers Central
References: 98-10-109 98-10-125
Keywords: LALR, parse

KPRASAD.US.ORACLE.COM wrote:
> The type of grammar accepted by LALR(k) is same as LR(k) and only the
> item states are combined when only lookaheads are differing to reduce
> state table. So I Guess The Definition For LR(k) Grammar Holds True
> For LALR(k) Grammar.


Actually, LALR(k) is a strict subset of LR(k), so additional
restrictions are needed.


Zem

Post a followup to this message

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