Theory of Computation MCQ (Multiple Choice Questions) - SchoolingAxis


 1. Which of the following is a parser for an ambiguous grammar?
a. GLR parser
b. Chart parser
c. All of the mentioned
d. None of the mentioned

Ans- c. All of the mentioned

2. Which of the following is an real-world programming language ambiguity?
a. dangling else problem
b. halting problem
c. maze problem
d. none of the mentioned

Ans- a. dangling else problem

3. A CFG is not closed under
a. Dot operation
b. Union Operation
c. Concatenation
d. Iteration

Ans- d. Iteration

4. Which of the following are always unambiguous?
a. Deterministic Context free grammars
b. Non-Deterministic Regular grammars
c. Context sensitive grammar
d. None of the mentioned

Ans- a. Deterministic Context free grammars

5. A CFG is ambiguous if :
a. It has more than one rightmost derivations
b. It has more than one leftmost derivations
c. No parse tree can be generated for the CFG
d. None of the mentioned

Ans- b. It has more than one leftmost derivations

6. Which of the following is incorrect for HTML5 markup construct?
a. Start tags: <section>
b. End tags: </section>
c. <img src= "abc.jpeg" >ABC</img>
d. None of the mentioned

Ans- d. None of the mentioned

7. Markup Languages are not used for which of the following?
a. playlists
b. content syndication
c. user interfaces
d. none of the mentioned

Ans- d. none of the mentioned

8. SGML stands for:
a. Standard Generalized Markup Language
b. Standardized General Markup Language
c. Standard General Markup Language
d. Standard Generalized Markdown Language

Ans- a. Standard Generalized Markup Language

9. troff and nroff are ___ in Unix.
a. functions
b. typesetting tools
c. System sofwares
d. None of the mentioned

Ans- b. typesetting tools

10. Which of the following is not an example of electronic mark up?
a. HTML
b. LaTeX
c. PostScript
d. None of the mentioned

Ans- d. none of the mentioned

11. In context to ambiguity, the number of times the following programming statement can be interpreted as: Statement: if R then if T then P else V
a. 2
b. 3
c. 4
d. 1

Ans- a. 2

A language that admits only ambiguous grammar:
a. Inherent Ambiguous language
b. Inherent Unambiguous language
c. Context free language
d. Context Sensitive language

Ans- a. Inherent Ambiguous language

Previous Post Next Post

Responsive Ad