Re: Can shift/reduce problems be eliminated?

"Ashwin" <ashwin21_99@hotmail.com> wrote in message
> I am working on an application that requires parsing C# code using the
> standard lex and yacc tools. In my code, I have defined the grammar as per
> the ECMA specs for C# language. For what I have implemented so far, parsing
> seems to be working the way I expect. However, I do get a few shift/reduce
> conflicts during the compilation of grammar. I am wondering if this is a
> cause for alarm. Perhaps I have not implemented the grammar properly.


The way I knew it, the C grammar has such an conflict relating
to the way else works. It might be that it can be factored out,
but most I know just say that an else applies to the most
recent if.


You should find out if the conflicts are part of the grammar,
or mistakes in implementing it.


-- glen

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