adplus-dvertising

Welcome to the Syntax Directed Definition and Translations MCQs Page

Dive deep into the fascinating world of Syntax Directed Definition and Translations with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Syntax Directed Definition and Translations, a crucial aspect of Compiler Design. In this section, you will encounter a diverse range of MCQs that cover various aspects of Syntax Directed Definition and Translations, 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 Syntax Directed Definition and Translations. 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 Syntax Directed Definition and Translations. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Syntax Directed Definition and Translations MCQs | Page 3 of 12

Explore more Topics under Compiler Design

Q21.
Which grammar violate rules of an operator grammar?
(i) P-> QR

(ii) P -> Q s R

(iii) P -> Ξ΅

(iv) P ->Q t

a.

(i) only

b.

(i) and (iii) only

c.

(ii) and (iii) only

d.

(iii) and (iv) only

Discuss
Answer: (b).(i) and (iii) only
Q22.
Consider the grammar rule
E -> E1 βˆ’ E2 for arithmetic expressions.

If E1 and E2 do not have any common sub expression, in order to get the shortest possible code

a.

E1 should be evaluated first

b.

E2 should be evaluated first

c.

Evaluation of E1 and E2 should necessarily be interleaved

d.

Order of evaluation of E1 and E2 is of no consequence

Discuss
Answer: (b).E2 should be evaluated first
Q23.
The grammar
A ->AA |( A)| Ξ΅
is not suitable for predictive-parsing because the grammar is

a.

Ambiguous

b.

Left-recursive

c.

Right-recursive

d.

An operator-grammar

Discuss
Answer: (a).Ambiguous
Q24.
Consider the grammar
E ->E + n | E # n | n

For a sentence n + n, form of the reduction are

a.

n, E + n and E + n # n

b.

n , E + n and E + E # n

c.

n , n + n and n + n # n

d.

n , E + n and E # n

Discuss
Answer: (d).n , E + n and E # n
Q25.
S -> (S)| a
Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar n1 n2 and n3 respectively.

a.

n1 < n2 < n3

b.

n1 = n3 < n2

c.

n1 = n2 = n3

d.

n1 $ n3 $ n2

Discuss
Answer: (b).n1 = n3 < n2
Q26.
Consider line 3:

Int main()

{ int 1,N;

Fro (I,1 N,1);

}

Identify the compiler’s response about this line while creating the object-module

a.

No compilation error

b.

Only a lexical error

c.

Only syntactic errors

d.

Both lexical and syntactic errors

Discuss
Answer: (c).Only syntactic errors
Q27.
Which one of the following is true about the action of yacc for the given grammar?

a.

It detects recursion and eliminates recursion

b.

It detects reduce-reduce conflict, and resolves

c.

It detects shift-reduce conflict, and resolves the conflict in favor of a shift over a reduce action

d.

It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift action

Discuss
Answer: (c).It detects shift-reduce conflict, and resolves the conflict in favor of a shift over a reduce action
Q28.
What precedence and associativity properties does the generated parser realize?

a.

Equal precedence and left associativity; expression is evaluated to 7

b.

Equal precedence and right associativity, expression is evaluated to 9

c.

Precedence of β€˜x’ is higher than that of β€˜+’, and both operators are left associative; expression is evaluated to 7

d.

Precedence of β€˜ # β€˜ is higher than that of β€˜#’, and both operators are left associative; expression is evaluated to 9

Discuss
Answer: (b).Equal precedence and right associativity, expression is evaluated to 9
Q29.
Consider the following grammar.
S > S * E

S > E

E > F + E

E > F

F > id

Consider the following LR(0) items corresponding to the grammar above

(i) S -> S * .E

(ii) E -> F . + E

(iii) E -> F + .E

Given the items above, which two of them will appear in the same set in the canonical sets-of-items for the grammar?

a.

(i) and (ii)

b.

(ii) and (iii)

c.

(i) and (iii)

d.

None of these

Discuss
Answer: (c).(i) and (iii)
Q30.
Consider the following grammar
S > FR

R > * S | Ξ΅

F > id

In the predictive parser table, M , of the grammar the entries M [ S, id] and M [ R,$] respectively

a.

{S ” FR} and {R ” Ξ΅}

b.

{S ” FR} and {}

c.

{S ” FR} and {R ” * S}

d.

{F ” id} and {R ” Ξ΅}

Discuss
Answer: (a).{S ” FR} and {R ” Ξ΅}
Page 3 of 12

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!

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...