Consider the context-free grammar G = (V, T, S, P), where V = {S, A}, T = {a, b}, and P consists of S → aSb | aAb, A → aA | λ. a. Show the derivation tree resulting from top-down parsing of the string aaaabb. b. Show the leftmost derivation of the string aaaabb.

Describe L(G) for the grammar G = (V, VT, S, P) where V = {0, 1, A, S},  VT = {0, 1}, and P consists of: (L(G) is a possibly infinite set of words. You can describe it by listing its elements, or explaining which elements are in the set L(G)) S → 0 S → ASA A → 1

QUESTION 4. rules: 1. 2. Let G= ({S}, {(,)), P, S) be a CFG, where P contains the following S→SSI(S)Se List three different strings in L(G). What is the language L(G)? (You may either give its name or characterize the strings in it.) 3. Show that the grammar G is ambiguous by constructing two different parse trees for some member of L(G). Can you revise the grammar G to make it unambiguous?

Consider the context-free grammar S- A$ A→ aAa | B B → bbB | A In each of the following questions list your set in alphabetical order with $ at the end of the list if it's included. Separate items using commas and no spaces. For example: x,y,$. If a set is empty write "empty". What is in First(S)? { What is in First(A)? { } What is in First(B)? { } What is in Follow(S)? { What is in Follow(A)? { } What is in Follow(B)? { }

Try to find the set of non-terminals (N), the set of terminals(V) and the start symbol. (1) E→E+T (2) E→ T (3) T→T* F (4) T- → F (5) F →i (6) F→ (E) Question: What is the language this grammar describes? Can you name it? Since we can find N, V, and start symbol from productions. Productions alone can describe the whole grammar.