Consider the following grammar and input string, S → S+S S → S*S S → (S) S → a Input string: a1*(a2+a3) Find out the parsing table using shift reduce parsing.

Write regular expression for the following languages, alphabet {0,1}a. The set of strings that do not end with 11b. The set of strings that do not contain substring 01c. The set of strings having 0 at every 3rd position.d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set ofall strings that are at least of length 4 and contains an even number of 1’s.

help fill out the table

Use the CYK algorithm to determine whether the strings abb, bbb, aabba andabbbb are in the language generated byS → AB,A → BB|a,B → AB|b.

COMPILER CONSTRUCTION Consider the following grammar;         S → S ; T  | T         T → s Show the parsing stack for the input string s;s;s

from the following grammar write a program to validate the string fast or fat . A--> fSt S--> as | a

Correct and detailed answer will be Upvoted else downvoted. Thank you!

What you need to do:1. Type that code up and run it to make sure that it is doing what it is supposed to do. Provide the strings in the header of the program when prompted.2. Use the logic in that program to design your own Recursive Descent parser in C for the following grammar:S →aABA →Abc | bB →d3. Make sure that you choose at least two strings that pass the grammar and one string that does not pass the grammar just like I did in the model program4. Submit both the code and a screen shot of your results for the choice of strings that you provided. Below is the C code that can be used to implement a Recursive Descent parser for the above grammar/* 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 =…

Build a grammar that generates the language that accepts odd numbers in binary. Build a grammar that generates a comma-separated list of numbers.

What language does the following grammar generate? Use set notation, English or regular expression to describe it.   S->bA | b A->abA | abS