generate an inherently ambiguous language

generate an ambiguous language but not inherently so

are unambiguous

can generate all possible fixed length valid computation for carrying out addition, subtraction, multiplication and division, which can be expressed in one expression

I only

I and II

II and III

II only

equal number of a ′s and b ′s

odd number of a ′s and odd number b ′s

even number of a ′s and even number of b ′s

odd number of a ′s and even number of a ′s

with unequal numbers of 0's and 1's.

including the null string.

Both (a) and (b)

None of these

s ---> sa | a

s ---> abX , X --> cY, Y --> a | axY

s ---> a sb | ab

none of these