Chapter 7, Problem 12PS

Draw the parse tree for expression   a = b / (a+c).

Question -Show the parse table execution for the following string, so that you can check if it is part of the language of this grammar: id,id,id : type                            (e.g. “a, b, c : int”) Stack Contents Current Input $$ D

Chomsky Normal Form: Most useful grammars can be translated into a nor-mal form making answers to questions about the language more transparent.

Create a BNF grammar using a parsimonious Python module. This should consist of a first name, space, and last name. The solution needs to be written in the Python programming language. After running the code it should draw a parse tree. Input examples: John Doe  Bob Simon

Computer Science   Use the Python PLY library to write a parser for the following grammar. You may assume variables A, B, and C are either integers, float, or strings. To simplify your work, assume that these variables have the same data type (choose one: integer, float, string). <program> → begin <stmt_list> end<stmt_list> → <stmt> | <stmt> ; <stmt_list><stmt> → <var> = <expression><var> → A | B | C<expression> → <var> + <var> | <var> - <var> | <var> Do the code please

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

Exam Saved 39 Required information NOTE: This is a multi-part question, Once an answer is submitted, you will be unable to return to this part Let G= (V, T, S, P be the phrase-structure grammar with V= (0. 1, A, S). T= (0, 1) and a set of productions Pconsisting of S - 1S, S- 00A, A QA, and A O. S 01:01:19 Identify the correct step to show that 111000 belongs to the language generated by G. Multiple Choice S- SO - S00 - S000 - 11A000 - 111000 S- 1S- 11S- 111S- 11100A - 111000 z Tools S- OS- 10s- 000S - 11100A- 111000 S- 15- 10S- 101S- 11100A - 111000 L...

Describe the parsing problem for a bottom-up parser.

N.B: it's a problem of compiler design.