0 0 votes Consider the following grammar which of the following is/are ambiguous? (i) S → y | SxS (ii) S → E | ExS and E → y (iii) S → Sxy | y Theory of Computation theory-of-computation grammar ambiguous + – goluabhinan 1.8k views answer comment Share Follow Print See 1 comment 1 1 comment reply Shaik Masthan commented Sep 11, 2018 reply Follow flag i) S → y | S x S is only ambiguous grammar in the given grammars consider the string: y x y x y 1st derivation :- S -> S x S -> y x S -> y x S x S -> y x y x S -> y x y x y 2nd derivation :- S -> S x S -> S x S x S -> y x S x S -> y x y x S -> y x y x y 2 2 replyShare Please log in or register to add a comment.
1 1 vote @Shaik Masthan you are deriving one from LHS and one From RHS, this isn't valid to prove it ambiguous? neeti answered Sep 12, 2018 neeti comment Share Follow See 1 comment 1 1 comment reply Shaik Masthan commented Oct 26, 2018 reply Follow flag CHECK IT BROTHER, I DID LMD's ONLY 0 0 replyShare Please log in or register to add a comment.
