Context Free grammer, PDA

in 2017 20? QUESTION 14 What is the regular expression that describes the following langung! (A.ab, abbbb, abbbbbbb,... ab 1 What is a correct context-free grammar for a language defined as OAS->SAB A-> aAb|A B -> aBbb OBs-> AB A-> aAbA B-> aBbb OCs. SBIA A -> aAb|A BaBbbA ODS-ALB A -> aAbA B> aBbb/ OM a(bbb) OB at a(bbb OC. Nab O Dab QUESTION 5 2 , 20).X is the PDA start symb Which of the following language is not Regular ? This filiorum PDA works for language L = { will be accepted by the PDA? O a'b"where m, n >=0 O a'b", where m = U mop 3 XALO 2 A. pust A ) 1 X sop. 1) A sol) I. CA pop. Z) 1 X p. 1) A sop. 1) SA pop. 2) 2X 3) ALA. por. 2) a'"c* where n. m.k >=0 O al where n >=0 asb? JESTION 27 Which of the following is a correct PDA constructed from grammar S S A (0, a, a, pop, 0) (0, b, b, pop, 0) (0.c, c, pop, 0) (0,, .pop. push(b), push(S).push(a).0) (0,A,S, pop, push(e)>, 0) OB. (0, a, a, pop, 0) (0, b, b, pop, O) (0.c, c, pop, 0) (0,A,S, pop, push(a).push(S).push(by,0) (0., S, pop, push(c), 0) (0, a, a, pop, 0) (0.6. b, pop, 0) (0.c, c, pop, 0) (0,A,S,