1. [10 Points] Consider the following context-free grammar G: S aSaSbbb | a (a) (2 points)...

 

Transcribed Image Text:

1. [10 Points] Consider the following context-free grammar G: S aSaSbbb | a (a) (2 points) Describe L(G). (b) (3 points) Show that G is an ambiguous grammar. (c) (5 points) Give an unambiguous grammar G' such that L(G')=L(G). 2. [7 Points] Consider the following grammar G: SABC A a Ab|X B bB|b C CcX (a) (2 points) Describe L(G). (b) (5 points) Is G ambiguous? State your answer "YES/NO" clearly and give a detailed proof. 1. [10 Points] Consider the following context-free grammar G: S aSaSbbb | a (a) (2 points) Describe L(G). (b) (3 points) Show that G is an ambiguous grammar. (c) (5 points) Give an unambiguous grammar G' such that L(G')=L(G). 2. [7 Points] Consider the following grammar G: SABC A a Ab|X B bB|b C CcX (a) (2 points) Describe L(G). (b) (5 points) Is G ambiguous? State your answer "YES/NO" clearly and give a detailed proof.

Answer rating: 100% (QA)

Question 1 a Description of LG The grammar G generates strings consisting of one or more as followed ... View the full answer