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) |
From: | "KPRASAD.US.ORACLE.COM" <KPRASAD@us.oracle.com> |
Newsgroups: | comp.compilers |
Date: | 21 Oct 1998 01:33:24 -0400 |
Organization: | Compilers Central |
References: | 98-10-109 |
Keywords: | parse, LALR |
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.
-kamal
Return to the
comp.compilers page.
Search the
comp.compilers archives again.