GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
129 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.6k points)  
edited by | 129 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 (41.5k points)  


Top Users Apr 2017
  1. akash.dinkar12

    3514 Points

  2. Divya Bharti

    2546 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,042 answers
63,234 comments
24,135 users