MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 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. |
A CFG consist of the following elements: |
| A. | a set of terminal symbols |
| B. | a set of non terminal symbols |
| C. | a set of productions |
| D. | all of the mentioned |
| Answer» E. | |
| 2. |
Find a regular expression for a grammar which generates a language which states :L contains a set of strings starting wth an a and ending with a b, with something in the middle. |
| A. | a(a*Ub*)b |
| B. | a*(aUb)b* |
| C. | a(a*b*)b |
| D. | None of the mentioned |
| Answer» B. a*(aUb)b* | |
| 3. |
If the partial derivation tree contains the root as the starting variable, the form is known as: |
| A. | Chomsky hierarchy |
| B. | Sentential form |
| C. | Root form |
| D. | None of the mentioned |
| Answer» C. Root form | |
| 4. |
There exists a Context free grammar such that:X->aX |
| A. | nWhich among the following is correct with respect to the given assertion? |
| B. | Left Recursive Grammar |
| C. | Right Recursive Grammar |
| D. | Non Recursive Grammar |
| E. | None of the mentioned |
| Answer» C. Right Recursive Grammar | |
| 5. |
If P is the production, for the given statement, state true or false.P: V->(V T)* represents that the left hand side production rule has no right or left context. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 6. |
From the definition of context free grammars,G=(V, T, P, S) |
| A. | nWhat is the solution of V T? |
| B. | Null |
| C. | Not Null |
| D. | Cannot be determined, depends on the language |
| E. | None of the mentioned |
| Answer» B. Null | |
| 7. |
a bRestriction: Length of b must be atleast as much length of a. |
| A. | nWhich of the following is correct for the given assertion? |
| B. | Greibach Normal form |
| C. | Context Sensitive Language |
| D. | Chomsky Normal form |
| E. | Recursively Ennumerable language |
| Answer» C. Context Sensitive Language | |
| 8. |
Context free grammar is called Type 2 grammar because of ______________ hierarchy. |
| A. | Greibach |
| B. | Backus |
| C. | Chomsky |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |