Re: Can shift/reduce problems be eliminated?

bonzini@gnu.org (Paolo Bonzini)
4 Jan 2003 22:46:46 -0500

          From comp.compilers
Related articles
Can shift/reduce problems be eliminated? ashwin21_99@hotmail.com (Ashwin) (2002-12-30)
Re: Can shift/reduce problems be eliminated? clint@0lsen.net (Clint Olsen) (2002-12-31)
Re: Can shift/reduce problems be eliminated? vugluskr@unicorn.math.spbu.ru (2002-12-31)
Re: Can shift/reduce problems be eliminated? cdc@maxnet.co.nz (Carl Cerecke) (2002-12-31)
Re: Can shift/reduce problems be eliminated? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2003-01-04)
Re: Can shift/reduce problems be eliminated? bonzini@gnu.org (2003-01-04)
Re: Can shift/reduce problems be eliminated? vugluskr@unicorn.math.spbu.ru (2003-01-04)
Re: Can shift/reduce problems be eliminated? cdc@maxnet.co.nz (Carl Cerecke) (2003-01-07)
Re: Can shift/reduce problems be eliminated? bje@redhat.com (Ben Elliston) (2003-01-07)
| List of all articles for this month |
From: bonzini@gnu.org (Paolo Bonzini)
Newsgroups: comp.compilers
Date: 4 Jan 2003 22:46:46 -0500
Organization: http://groups.google.com/
References: 02-12-121 02-12-137
Keywords: parse
Posted-Date: 04 Jan 2003 22:46:46 EST

> <grumble>
> I'm currently finishing off a parser for a rather large language with
> many such tricky cases. The current version of my grammar "contains 147
> shift/reduce conflicts and 232 reduce/reduce conflicts.", according
> to bison, in a generated parser of over 2000 states. Beware of languages
> designed by comittee!
> </grumble>


Aren't you better off using bison's new GLR parser support?


Paolo

Post a followup to this message

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