Consider the following CFG G= ({S, A, B}, {0,1},R, S) where R is given below R:SOS/1A;...

Transcribed Image Text:

Consider the following CFG G= ({S, A, B}, {0,1},R, S) where R is given below R:SOS/1A; A → IB/IS /e ; B → OB /OS /e (a) Is the language LG a regular language? If so compute an NFA that accepts it; if not explain why not. (Hint: Note that G is a right linear CFG) (b) Sketch a parse tree for the string 00110 € LG. Based on your parsing diagram discuss whether G is an ambiguous or a non-ambiguous grammar. Consider the following CFG G= ({S, A, B}, {0,1},R, S) where R is given below R:SOS/1A; A → IB/IS /e ; B → OB /OS /e (a) Is the language LG a regular language? If so compute an NFA that accepts it; if not explain why not. (Hint: Note that G is a right linear CFG) (b) Sketch a parse tree for the string 00110 € LG. Based on your parsing diagram discuss whether G is an ambiguous or a non-ambiguous grammar.

Answer rating: 100% (QA)

Step1 To determine if the language L G is regular we need to check if the grammar G is a regul... View the full answer