MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Are ambiguous grammar context free? |
| A. | Yes |
| B. | No |
| Answer» B. No | |
| 2. |
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is |
| A. | 3 |
| B. | 7 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 3. |
For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced? |
| A. | Non regular language |
| B. | 0n1n | n>=0 |
| C. | 0n1n | n>=1 |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
Which of the expression is appropriate?For production p: a->b where a∈V and b∈_______ |
| A. | V |
| B. | S |
| C. | (V+∑)* |
| D. | V+ ∑ |
| Answer» D. V+ ∑ | |
| 5. |
Which among the following cannot be accepted by a regular grammar? |
| A. | L is a set of numbers divisible by 2 |
| B. | L is a set of binary complement |
| C. | L is a set of string with odd number of 0 |
| D. | L is a set of 0n1n |
| Answer» E. | |
| 6. |
The Grammar can be defined as: G=(V, ∑, p, S)In the given definition, what does S represents? |
| A. | Accepting State |
| B. | Starting Variable |
| C. | Sensitive Grammar |
| D. | None of these |
| Answer» C. Sensitive Grammar | |
| 7. |
ARE_AMBIGUOUS_GRAMMAR_CONTEXT_FREE??$ |
| A. | Yes |
| B. | No |
| Answer» B. No | |
| 8. |
WHICH_OF_THE_FOLLOWING_STATEMENT_IS_CORRECT??$ |
| A. | All Regular grammar are context free but not vice versa |
| B. | All context free grammar are regular grammar but not vice versa |
| C. | Regular grammar and context free grammar are the same entity |
| D. | None of the mentioned |
| Answer» B. All context free grammar are regular grammar but not vice versa | |
| 9. |
The minimum number of productions required to produce a language consisting of palindrome strings over ‚àë={a,b} i?# |
| A. | 3 |
| B. | 7 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 10. |
For S->0S1|e for ‚àë={0,1}*, which of the following is wrong for the language produced?$ |
| A. | Non regular language |
| B. | 0<sup>n</sup>1<sup>n</sup> | n>=0 |
| C. | 0<sup>n</sup>1<sup>n</sup> | n>=1 |
| D. | None of the mentioned |
| Answer» E. | |
| 11. |
Which of the expression is appropriate? |
| A. | |
| B. | V |
| C. | S |
| Answer» D. | |
| 12. |
Which among the following cannot be accepted by a regular grammar? |
| A. | L is a set of numbers divisible by 2 |
| B. | L is a set of binary complement |
| C. | L is a set of string with odd number of 0 |
| D. | L is a set of 0<sup>n</sup>1<sup>n</sup> |
| Answer» E. | |
| 13. |
The Grammar can be defined as: G=(V, ‚àë, p, S)$ |
| A. | |
| B. | Accepting State |
| C. | Starting Variable |
| Answer» C. Starting Variable | |
| 14. |
Production Rule: aAb->agb belongs to which of the following category? |
| A. | Regular Language |
| B. | Context free Language |
| C. | Context Sensitive Language |
| D. | Recursively Ennumerable Language |
| Answer» D. Recursively Ennumerable Language | |
| 15. |
The entity which generate Language is termed as: |
| A. | Automata |
| B. | Tokens |
| C. | Grammar |
| D. | Data |
| Answer» D. Data | |