what langugage?? grammar #1: S->(L)|a L->L,S|S what language does this grammar generate? some strings generated by this grammar r (a,a), (a,(a,a)).... grammmar #2: bexpr->bexpr or bterm| bterm bterm-> bterm and bfactor| bfactor bfactor-> not bfactor| (bexpr) | true | false is this grammar ambiguous? if so then why? is there any way to eliminate ambiguity? how do i show that this grammmar generates all boolean expressions? i can see it but how do i proceed to prove it?