Consider the following context-free grammar for statements: 1) E → E+T 2) E →T 3) T → I*F 4) T → F 5) F → (E) 6) F → id which can be analyzed with the LR Parsing Table given as following. Action Goto id + * (D $ E TF State $5 s4 12 3 1 s6 асс 2 r2 s7 r2 r2 3 r4 r4 r4 r4 4 s5 s4 8 2 3 5 r6 r6 r6 r6 s5 s4 9 3 7 s5 s4 10 8 s6 s11 9. rl s7 rl rl 10 r3 r3 r3 r3 11 r5 r5 r5 r5 Show a complete parse, including the parse stack contents, input string, and action for the string id* (id + id), using the grammar and parse table given.

. Consider the following grammar (G1) for simple assignment statements. (The symbols that begin with upper-case letters are variables and Assign is the start variable.) Assign Id := Expr Id → abc Expr | Expr * Expr |(Expr) | Id Expr → Expr a) Give a (leftmost) derivation for string a := b ⋆ a — c. b) Give a parse tree for string a := b ⋆ a — c.

The following is a context-free grammar G: V={A,B,C} S={a,b} vO=S S->A A alb| A B A->B S ala B->B al\e Convert G into an equivalent context-free grammar in Chomsky normal form. a) Show your grammar rules after Step 1 b) Show your grammar rules after Step 2 c) Show your grammar rules after Step 3 d) Show your grammar rules after Step 4

Let E = {a,b}. Find the language generated by following grammar: (1) S- aSb| a (2) S- AS S- aSb| b A - a4| .

Solve it wrong answer downvote

Select the Context Free Grammar below that is in the form of Chomsky Normal Form. G=( {S,a,b}, {0,1}, S, {S0b|1a, a0|OS|1aa, b➡1|1s|Obb}) ☐ G=( {S,a,b}, {0,1}, S, {Sab|1, a0|1|Sa, b→1|bs}) ☐ G=( {S,A,B}, {a,b}, S, {S AB|bA, Aa|b|SB, B→a|SB}) ☐ G=( {S,A,B}, {a,b}, S, {S-BB|b, A➡a|b|SS, B→a|SA})

expr term_tail term factor_tail id = expr | term term_tail + term term_tail | E factor factor_tail → * factor factor_tail | e factor → (expr) | id Explain why the grammar above is not LL(1). Be specific.

Write the FIRST and FOLLOW sets for this grammar

1. The grammar is known as follows:P → H | PbdHH → a | (P)Asked: b. Please Make an SLR table from the grammar above

Question 2-Context-free Grammars Consider the alphabet = {A, V., (,), x, y, z) and the following grammar G = (V,E, R, F), defined by the rules: F (FAF) | (FVF) | (F) | P (a) Identify the set of variables and the set of terminal symbols of G. (b) Identify three words (of lengths between 10 and 20) that can be generated by the above grammar and show their derivations. (c) Consider a modified grammar G', where we remove the brackets '(' and ')' from the alphabet and the derivation rules. That is we set Σ'= {A, V., x, y, z) and we remove all occurrences of brackets in the derivation rules. Show that there are words that are derived ambiguously in G'