HAJNAL Akos <hajnal@eik.bme.hu> wrote:>My question is that, there is available a C grammar in lex/yacc>that does not contain any shift/reduce conflict?>Can such grammar exsist?

Try to find a copy of the 1st edition of C: A Reference Manual by
Harbison and Steele. They give an LALR(1) grammar for C that handles
if-then-else without conflicts. The LALR(1) grammar does not appear
in the latest edition.

It is possible to write an LALR(1) grammar for C, assuming a lexical
analyzer that distinguishes typedef-names from identifiers. It is a
pain to do so, and the resulting parser will be slower than a parser
for a grammar with some well-chosen and properly handled conflicts.