1)

Let L be the language generated by the following grammar G:

S 1 S 1

S T

T 1 X 1

T X

X 0 X 0

X 1

(2) Show G is ambiguous. You may do so by showing string 111 in G has more than one parse tree. Simply draw two parse trees below for string 111.