Consider the following grammar

= {A, B, C, D, +, , ,),( }

V = {S, V AR, OP}

P = { S V AR,

S V AR OP V AR,

S ( S ), V AR ( S ),

V AR A, V AR B,

V AR C, V AR D,

OP +, OP ,

OP ,

}

Determine which of the following strings are in the language generated by this grammar:

( A + (( B + C ) - D ))

(((((( B )))))

( (A + ( + ( B + ( - C + D ))))

(A + A + A )

( A + ( A ) + ( A + ( A ) ) )