If there are more than one left parse tree (derivation tree) for a given string in a language generated by the Context Free Grammar, G, then the grammar G is the [ans] grammar.

Given the grammar below, construct parse trees for the strings given: A ⇒ A + B | B B BXC | C C (A) | a (i) a (ii) axa (iii) a + a + a (iv) ((a))

Find a regular grammar that generates the language L ((aaab*ab)*).

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?

The set of all syntactically valid strings representing regular expressions is A. a regular language, because a regular expression can describe this language B. a context-free language and it can be generated by a context-free grammar but not by any regular grammar O C. a context-sensitive language but not by any context-free grammar

How to write a context-free grammar for the set of strings over the alphabet {a, b} where each stringhas odd length and the middle character is an a. bbaaa and abaabba are strings but aaaa and abbba are not.