Re: LR Grammars not in LALR(1) or LR(1)

"Hans Aberg" <haberg@matematik.su.se>
22 Sep 2002 12:20:13 -0400

          From comp.compilers
Related articles
[3 earlier articles]
Re: LR Grammars not in LALR(1) or LR(1) tbandrow@unitedsoftworks.com (tj bandrowsky) (2002-09-12)
Re: LR Grammars not in LALR(1) or LR(1) tbandrow@unitedsoftworks.com (tj bandrowsky) (2002-09-12)
Re: LR Grammars not in LALR(1) or LR(1) haberg@matematik.su.se (Hans Aberg) (2002-09-12)
Re: LR Grammars not in LALR(1) or LR(1) soenke.kannapinn@wincor-nixdorf.com (=?Windows-1252?Q?S=F6nke_Kannapinn?=) (2002-09-14)
Re: LR Grammars not in LALR(1) or LR(1) haberg@matematik.su.se (Hans Aberg) (2002-09-14)
Re: LR Grammars not in LALR(1) or LR(1) thp@cs.ucr.edu (2002-09-20)
Re: LR Grammars not in LALR(1) or LR(1) haberg@matematik.su.se (Hans Aberg) (2002-09-22)
Re: LR Grammars not in LALR(1) or LR(1) thp@cs.ucr.edu (2002-09-25)
Re: LR Grammars not in LALR(1) or LR(1) Mark.van.den.Brand@cwi.nl (M.G.J. van den Brand) (2002-09-25)
Re: LR Grammars not in LALR(1) or LR(1) Mark.van.den.Brand@cwi.nl (M.G.J. van den Brand) (2002-09-29)
Re: LR Grammars not in LALR(1) or LR(1) haberg@matematik.su.se (Hans Aberg) (2002-09-29)
Re: LR Grammars not in LALR(1) or LR(1) joachim_d@gmx.de (Joachim Durchholz) (2002-09-29)
Re: LR Grammars not in LALR(1) or LR(1) clint@0lsen.net (Clint Olsen) (2002-10-13)
[6 later articles]
| List of all articles for this month |
From: "Hans Aberg" <haberg@matematik.su.se>
Newsgroups: comp.compilers
Date: 22 Sep 2002 12:20:13 -0400
Organization: Mathematics
References: 02-09-014 02-09-029 02-09-068 02-09-092 02-09-097 02-09-126
Keywords: parse
Posted-Date: 22 Sep 2002 12:20:13 EDT

In article 02-09-126, thp@cs.ucr.edu wrote:


... Almost every parser-
>generation tool has some form of disambiguation rules, so nobody in
>their right mind submits an LALR(1) grammar to, say, YACC. Rather,
>they submit a more intuitive and compact ambiguous grammar, one that
>reflects the semantics of the language, and then use the disambuation
>rules to make it parsable.


Even though precedence rules can be made a part of the grammar:


I got the references:
      http://www.cs.uu.nl/people/visser/ftp/BSVV02.pdf
http://citeseer.nj.nec.com/cache/papers/cs/6488/http:zSzzSzftp.cs.uu.nlzSzpeoplezSzvisserzSzpublicationszSz..zSzftpzSzP9707.pdf/visser97scannerles.pdf


But I haven't looked it fully up yet.


    Hans Aberg * Anti-spam: remove "remove." from email address.
                                    * Email: Hans Aberg <remove.haberg@member.ams.org>
                                    * Home Page: <http://www.matematik.su.se/~haberg/>
                                    * AMS member listing: <http://www.ams.org/cml/>

Post a followup to this message

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