1. Two grammars are given:
S :: =SS | 0|1
T :: =0T|1T|0|1
A) The first grammar is ambiguous. This means that for some expression in the language(not necessarily for all), the expression has more than one parse tree. Give an expression that is in the language and give two different parse tree for it.
B) The second grammar is unambiguous. This means that every expression in the language has exacty on parse tree. Show the parse tree for the expression 110.