GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
113 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..

 

asked in Compiler Design by Loyal (2.5k points)  
edited by | 113 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..

1 Answer

+3 votes

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.

Answer : No Answer

answered by Veteran (40.7k points)  
Top Users Jan 2017
  1. Debashish Deka

    7906 Points

  2. Habibkhan

    4736 Points

  3. Vijay Thakur

    4474 Points

  4. sudsho

    4318 Points

  5. saurabh rai

    4200 Points

  6. Arjun

    3638 Points

  7. Bikram

    3494 Points

  8. santhoshdevulapally

    3470 Points

  9. GateSet

    3228 Points

  10. Sushant Gokhale

    3116 Points

Monthly Topper: Rs. 500 gift card

18,944 questions
23,897 answers
52,114 comments
20,213 users