144 views

Consider the $SDTS$ for the ambiguous grammar

$E \rightarrow E + E$        $out ("1 + 2 ")$

$E \rightarrow E ^{*} E$         $out ("2 ^{*} 3")$

$E \rightarrow num$          $out (num.val)$

Assume a shift reduce parser. The output is treated as an arithmetic expression in $C$ & evaluated. The input is $1 ^{*} 1 + 1$.

The value obtained is _______.

EDIT: Here's the explanation given..

edited | 144 views
@Amsar @Pooja @Arjun sir
@ Tushar, there r two possible Derivation trees ,

one will give 112*311+2

& other will give 1111 + 22 * 3
See the edit. And how can there be 2 answers? Its a numerical answer wala qstn..

The Grammar is ambiguous  .How can we assume a SR parser for ambiguous  Grammar .I don't think this question is Right. No Parse can parse the ambiguous  Grammar Except Operator Precedence Parse ( it can parse only some of the ambiguous  Grammar Not All )  as far as i  Know.