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.

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.

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

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 =…

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

The following YACC snippet is used to implement a grammar of an expression. The expressions are : E-> E +E E-> E'E E-> id program: program expr '\n' { printf("Kd\n", S2); ) expr: { SS - $1; } i ss - s1- $3; } { $S - $1 - $3; } INTEGER I expr + expr I expr expr Modify the above code to handle the following grammar rules: E-> Add EE E -> Sub EE E-> Mul EE E-> Div EE E-> id, where Add, Sub, Mul, and Div are used to implement Addition, subtraction, multiplication, and division operations respectively.

RE to RG Conversion Please solve....

d. Write a Lisp program that verifies if a list of symbols is correct from the point of view of this grammar. For example, (check-A '(y w z w y)) (check-A '(y z w w)) should return true (t) and should return false (nil).

Design a context-free grammar that accepts the language of all binary strings with at most one occurrence of 000.      Please type answer no write by hend.

Rewrite the grammar so that it is not ambiguous any more.  <S> -> <A> <A> -> <A> + <A> | <id> <id> -> a | b | c