Question

4. (5 points) Is the following grammar ambiguous? Justify your answer (give a string and derive it with two leftmost derivati

0 0
Add a comment Improve this question Transcribed image text
Answer #1

This grammar is ambiguous

take 001 string

a)S->0S

S->00S1S (S->0S1S)

S->001 (S->epsilon)

b)S->0S1S

S->00S1S (S->0S)

S->001   (S->epsilon)

we have two leftmost derivations therefore grammar is ambiguous.

we convert ambiguous grammar to unambiguous grammar by hit and trail method ..there are no derivations for that.

S->0S | TS | ^ (^==EPSILON)

T->0T1 | ^

we take any string we will get only one parse tree.just replacing the 0S1 with another variable T.

if u understand like else post a comment.

Add a comment
Know the answer?
Add Answer to:
4. (5 points) Is the following grammar ambiguous? Justify your answer (give a string and derive...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT