Please answer all the questions

LALR(1) has the same number of states as SLR(1) a. *True b. False Consider the following grammar. S aAdx1 bBdy I bAeu ! aBev , A c , B c , is it LALR(2)? a. *Yes b. No Consider the following grammar: S A-B), A B l a) , B aB I a , will it accept the string "a)-aaa)"? a. Yes b. *No What is the language of the grammar with the following production rules? S d. All of the answers above are incorrect Consider the following grammar. S aAbB | Bc , A aAa l a , B Bb | Ab | cc IAC , C c , calculate First(A) a. *fa)] b. (a, b) c. (a, c) d. All of the answers above are incorrect