GATE | GATE-CS-2005 | Question 85

Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production.

 E → number 	 E.val = number. val
    | E \'+\' E 	 E(1).val = E(2).val + E(3).val
    | E \'×\' E	 E(1).val = E(2).val × E(3).val

The above grammar and the semantic rules are fed to a yacc tool (which is an LALR (1) parser generator) for parsing and evaluating arithmetic expressions. Which one of the following is true about the action of yacc for the given grammar?

(A)

It detects recursion and eliminates recursion

(B)

It detects reduce-reduce conflict, and resolves

(C)

It detects shift-reduce conflict, and resolves the conflict in favor of a shift over a reduce action

(D)

It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift action

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News