|Looking for shift/reduce conflict analyser firstname.lastname@example.org (1994-12-23)|
|Re: Looking for shift/reduce conflict analyser email@example.com (1994-12-27)|
|Re: Looking for shift/reduce conflict analyser firstname.lastname@example.org (1995-01-11)|
|From:||email@example.com (Rogier van de Pol)|
|Keywords:||parse, LR(1), tools,question|
|Date:||Fri, 23 Dec 1994 10:54:07 GMT|
Looking for a shift/reduce conflict analyser.
We are developing parsers for a wide range of languages, using bison as a
lalr(1) parser generator. However, these grammars tend to grow large. When
a shift/reduce conflict is introduced in the process of developing the parser.
we would like to see information about it.
Therefore I am looking for a shift/reduce conflict analyser. The output it must
produce should be a derivation tree, from which can be read how the items and
the lookahead get into the conflicting situation. In general there should
be two trees, when the derivations for the conflicting items are different.
In fact, the GMD-Cocktail project LALR-parser generator prints such a tree when
constructing the parser. But when using the LALR-parser generator on a large
grammar (4000 lines,definitions, programs and semantic actions not included)
it dumps core. For grammars of other languages it works fine.
Does someone know where some sort of shift/reduce conflict analyser can
be ftp'ed? Thanks in advance.
By the way, the GMD-Cocktail project can be ftp'ed from
This site mirrors ftp.karlsruhe.gmd.de, the origin of the Cocktail project.
Denis Kieft, reachable via the account of firstname.lastname@example.org
Return to the
Search the comp.compilers archives again.