The below grammar and the semantic rules are fed to a yacc tool (which is an LALR (1) parser generator) for parsing and

[answerhappygod]

advertisement


var adpushup = window.adpushup || {};
adpushup.que = adpushup.que || [];
adpushup.que.push(function () {
if (adpushup.config.platform === "MOBILE") {
adpushup.triggerAd("e25be634-2f62-4ed5-978b-3aaec04c8aca");
} else if ((window.outerWidth <= 768) || (window.outerWidth == 0)) {
adpushup.triggerAd("e25be634-2f62-4ed5-978b-3aaec04c8aca");
}
});
E -> number Eval number val
E E .val E .VAL E .val
E # E E .val E .VAL E .val
;
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