MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 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 for a program describing strings of letters with the word “main” somewhere in the string: |
| A. | -> m a i n -> | epsilon -> A | B | … | Z | a | b … | z |
| B. | –> m a i n –> –> A | B | … | Z | a | b … | z |
| C. | –> m a i n –> | epsilon –> A | B | … | Z | a | b … | z |
| D. | None of the mentionedView Answer |
| Answer» B. –> m a i n –> –> A | B | … | Z | a | b … | z | |
| 2. |
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. | |
| 3. |
Which of the following is the correct representation of grammar for the given regular expression?a(aUb)*b |
| A. | (1) S → aMb (2) M → e (3) M → aM (4) M → bM |
| B. | *b a) (1) S → aMb (2) M → e (3) M → aM (4) M → bM b) (1) S → aMb (2) M → Mab (3) M → aM (4) M → bM |
| C. | (1) S → aMb (2) M → e (3) M → aMb (4) M → bMa |
| D. | None of the mentionedView Answer |
| Answer» B. *b a) (1) S → aMb (2) M → e (3) M → aM (4) M → bM b) (1) S → aMb (2) M → Mab (3) M → aM (4) M → bM | |
| 4. |
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*)bb) a*(aU |
| B. | a*(aUb)b* |
| C. | a(a*b*)b |
| D. | None of the mentioned |
| Answer» B. a*(aUb)b* | |
| 5. |
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 | |
| 6. |
There exists a Context free grammar such that:X->aXWhich among the following is correct with respect to the given assertion? |
| A. | Left Recursive Grammar |
| B. | Right Recursive Grammar |
| C. | Non Recursive Grammar |
| D. | None of the mentioned |
| Answer» C. Non Recursive Grammar | |
| 7. |
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 | |
| 8. |
From the definition of context free grammars,G=(V, T, P, S)What is the solution of VÇT? |
| A. | Null |
| B. | Not Null |
| C. | Cannot be determined, depends on the language |
| D. | None of the mentioned |
| Answer» B. Not Null | |
| 9. |
a→bRestriction: Length of b must be atleast as much length of a.Which of the following is correct for the given assertion? |
| A. | Greibach Normal form |
| B. | Context Sensitive Language |
| C. | Chomsky Normal form |
| D. | Recursively Ennumerable language |
| Answer» C. Chomsky Normal form | |
| 10. |
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 | |