Q: writing YACC rules

Bert Aerts <Bert.Aerts@esat.kuleuven.ac.be>
24 Aug 1998 13:36:08 -0400

          From comp.compilers

Related articles
Q: writing YACC rules Bert.Aerts@esat.kuleuven.ac.be (Bert Aerts) (1998-08-24)
Re: Q: writing YACC rules clark@quarry.zk3.dec.com (Chris Clark USG) (1998-08-30)
Re: Q: writing YACC rules collins@cs.wm.edu (1998-08-31)
Re: Q: writing YACC rules thetick@magelang.com (Scott Stanchfield) (1998-08-31)
Examples to illustrate problem Bert.Aerts@esat.kuleuven.ac.be (Bert Aerts) (1998-08-31)
Re: Q: writing YACC rules chrisd@reservoir.com (Chris Dodd) (1998-09-01)
Re: Examples to illustrate problem cfc@world.std.com (Chris F Clark) (1998-09-05)
| List of all articles for this month |

From: Bert Aerts <Bert.Aerts@esat.kuleuven.ac.be>
Newsgroups: comp.compilers
Date: 24 Aug 1998 13:36:08 -0400
Organization: KUL
Keywords: yacc, question, comment


I'm writing a parser for quite a while now, but everytime I have to
extend the syntax, I bounce into errors that the parser is reducing my
token sequences always according to the wrong rule - albeit a rule
that has a strong resemblence with the correct one.

The books I've learned it from explain how you can write your syntax,
but they don't give a methodology to follow when writing fail-safe
YACC-rules ( "fail-safe" just means that the user provides the parser
with a correct syntax ).

Suggestions are greatly appreciated,

  mail : Bert Aerts
                    Katholieke Universiteit Leuven
                    ESAT-MICAS-group room 91.21
                    Kardinaal Mercierlaan 94
                    B-3000 Leuven, Belgium
  phone : 0032-(0)16-32 10 76 - fax : 0032-(0)16-32 19 75
  E-mail : Bert.Aerts@esat.kuleuven.ac.be
  URL : http://www.esat.kuleuven.ac.be/~aerts
[Odd, that's never been much of a problem for me. These parsers wouldn't
have a lot of shift/reduce or reduce/reduce conflicts, would they? -John]

Post a followup to this message

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