Find a CFG for each of the following non-regular languages and write the parse tree or...

 

Transcribed Image Text:

Find a CFG for each of the following non-regular languages and write the parse tree or the derivation for each of the given strings: a. L = set of words in which the number of a's is twice the number of b's. Please note that the empty string belongs to L. (4 points) Parse tree or derivation tree for w=ab5aaba and b. L={a"b|m>=n; n=1,2,3......... } (4 points) Parse tree or derivation tree for w=abs and w=ab4 L={a"bPcm| p=2n+m, n=1,2,3,........ and m=0,1,2,...... } (4 points) w2=a bc Parse tree or derivation tree for wl=abc and w-babaabaaba d. L={abc| p=2n+3m; n=0,1,2,3,..... and m=1,2,3,.........} Parse tree or derivation tree for wl=abc (4 points) and w2=ac Find a CFG for each of the following non-regular languages and write the parse tree or the derivation for each of the given strings: a. L = set of words in which the number of a's is twice the number of b's. Please note that the empty string belongs to L. (4 points) Parse tree or derivation tree for w=ab5aaba and b. L={a"b|m>=n; n=1,2,3......... } (4 points) Parse tree or derivation tree for w=abs and w=ab4 L={a"bPcm| p=2n+m, n=1,2,3,........ and m=0,1,2,...... } (4 points) w2=a bc Parse tree or derivation tree for wl=abc and w-babaabaaba d. L={abc| p=2n+3m; n=0,1,2,3,..... and m=1,2,3,.........} Parse tree or derivation tree for wl=abc (4 points) and w2=ac

Answer rating: 100% (QA)

a contextfree grammar CFG for each of the following nonregular languages and write the parse tree or derivation for each of the given strings a L anbpcm p 2n m n 0 m 0 This language consists of string... View the full answer