11. |
S aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
|
||||||||
Answer:
Option (c) |
12. |
There exists a Context free grammar such that:
XXa is
|
||||||||
Answer:
Option (a) |
13. |
is which grammar?
|
||||||||
Answer:
Option (b) |
14. |
Which of the following is the correct representation of grammar for the given regular expression?
|
||||||||
Answer:
Option (a) |
15. |
The context free grammar generates
|
||||||||
Answer:
Option (b) |
16. |
CFG for balanced parenthesis
|
||||||||
Answer:
Option (a) |
17. |
The language of {a, b} ends in a
|
||||||||
Answer:
Option (d) |
18. |
The following production rules of a regular grammar generate a language L:
S aS | bS | a | b The regular expression of L is
|
||||||||
Answer:
Option (b) |
19. |
Which of the following languages are context free language?
|
||||||||
Answer:
Option (a) |
20. |
The most suitable data structure used to represent the derivations is:
|
||||||||
Answer:
Option (b) |