Let E = {a, b, c}. Write a grammar that generates the language: %3D L = {c"ww" a":n > 0, m > 0, w E £+}

Convert this grammar into a push down automaton

Here's the code:  /* Recursive Descent Parser for the Expression Grammar:S → (L) |aL' →,SL'|εL → SL'Valid inputs: (a,(a,a)) and (a,((a,a),(a,a)))Invalid inputs:(aa,a)*/#include <stdio.h>#include <string.h>int S(), Ldash(), L();char *ip;char string[50];int main()               {printf("Enter the string\n");scanf("%s", string);ip = string;printf("\n\nInput\t\tAction\n ------------------------------\n");if (S()){printf("\n------------------------------------------------\n");printf("\n String is successfully parsed\n");}else{printf("\n ------------------------------------------------\n");printf("Error in parsing string\n");}}int L(){printf("%s\t\tL →SL' \n", ip);if (S()){if (Ldash()){return 1;}elsereturn 0;} elsereturn 0;}int Ldash(){if (*ip == ','){printf("%s\t\tL' →, SL' \n", ip);ip++;if (S()){if (Ldash()){return 1;}elsereturn 0;}else               return 0;}else{printf("%s\t\tL' →ε \n", ip);return 1;}}int S(){if (*ip == '('){ printf("%s\t\tS →(L)…

Create an NPDA for the following language:On summation  = {0.1}Language 1 (L1) every string in the language begin and end with 1Language 2 (L2) all strings in the language begin with 001The union of L1 and L2