How many terminals in the below CFG E E + T | T T T x F | F F (E) | a

(2 Points)

1

None

3

4

2

2.Minimum string generated by the below CFG E E + T | T T T x F | F F (E) | a

(2 Points)

a+a

(a)

None

a x a

3.Consider the grammar S XSX | R R aTb | bTa T XTX | X | X a | b which string can't be generated by the given grammar?

(2 Points)

None

abb

aab

ab

aba

4.How many rules/productions in the below CFG S XSX | R R aTb | bTa T XTX | X | X a | b

(1 Point)

9

None

7

10

8

5.Minimum string generated by the below CFG S XSX | R R aTb | bTa T XTX | X | X a | b

(2 Points)

ab

a

None

b

6.CFL is the subset of the RL.

(1 Point)

False

True