adplus-dvertising

Welcome to the Error Handling MCQs Page

Dive deep into the fascinating world of Error Handling with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Error Handling, a crucial aspect of Compiler Design. In this section, you will encounter a diverse range of MCQs that cover various aspects of Error Handling, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Compiler Design.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Error Handling. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Compiler Design.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Error Handling. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Error Handling MCQs | Page 1 of 3

Q1.
In Right-Linear grammars, all productions have the form: A → xB.
Discuss
Answer: (a).True
Q2.
A Push Down Automata is if there is at most one transition applicable to each configuration
Discuss
Answer: (a).Deterministic
Q3.
Consider the grammar with the following translation rules and E as the start symbol.
A -> A1 #B {A.value = A1.value * B.value}

| B {A.value = B.value}

B-> B1 & F {B.value = B1.value + C.value}

| C {B.value= C.value }

C -> num {C.value = num.value}

Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.
Discuss
Answer: (c).160
Q4.
Find the TRUE statement?
I. There exist parsing algorithms for some programming languages which has O (3) complexities

II. A programming language which allows recursion can be implemented with static storage allocation.

III.No L-attributed definition can be evaluated in The framework of bottom-up parsing.

IV. Code improving transformations can be performed at both intermediate code level and source Language.
Discuss
Answer: (b).I and IV
Q5.
Consider the following two statements:
P: Every regular grammar is LL(1)

Q:Regular is LR(1) grammar

Which of the following is TRUE?
Discuss
Answer: (c).P is false and Q is true
Q6.
Consider the grammar defined by the following production rules
S --> T * P

T --> U | T * U

P --> Q + P | Q

Q --> Id

U --> Id

Which one of the following is TRUE?
Discuss
Answer: (b).+ is right associative, while ∗ is left associative
Q7.
Which grammar rules violate the requirements of an operator grammar ?
1.P → Q R

2.P → Q s R

3.P → ε

4.P → Q t R r
Discuss
Answer: (b).1 and 3 only
Q8.
S → C C
C → c C | d

The grammar is
Discuss
Answer: (a).LL(1)
Q9.
Given the following expression grammar:
E -> E * F | F + E | F

F -> F - F | id

Which of the following is true?
Discuss
Answer: (b).– has higher precedence than *
Q10.
lanation: e.g. input is 3*4-5 rFirst ‘- ‘ is be evaluated then ‘ *’.5. Which one of the following is true at any valid state in shift-reduce parsing?
Discuss
Answer: (c).Stack contains only viable prefixes
Page 1 of 3

Suggested Topics

Are you eager to expand your knowledge beyond Compiler Design? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!