CS606 Final Term Solved Quizzes and MCQs with References Set 2

Year 2013

1)

The regular expressions a*|b* and (a|b)* describe the _____set of strings. Same

Different

Onto

2)

A canonical collection of sets of items for an augmented grammar, C is constructed as ----- For each set / in C and each grammar symbol X where goto (C, X) is empty and not in C add the set goto (C, X) to C. The first set in C is the closure of {[S' --> .S]}, where S’ is starting symbol of original grammar and S is the starting non-terminal of augmented grammar. Page no : 72 The first set in C is the closure of {[S' --> .S]}, where S is starting symbol of original grammar and S' is the starting non-terminal of original grammar.

3)

S --> a | B B --> Bb | E The non-terminal _______ is left recursive.

Answer: B

4)

parsed bottom-up by the following reduction steps: (i) aTbcde (ii) aTde (iii) aTUe (iv) S So, what can be a handle from the following?

The (a) in (aTUe) not confirm · Solved by: · Sahar (well wisher) · Class · BSCS 6th Semester · Subject

CS606 (COMPILER CONSTRUCTION)

Solution Type:

Final Term Solved MCQZ and Quizez including Papers of Year : 2013,2012,2011,2010,2009… 2006

Institute:

Virtual University of Pakistan

The (a) in (aTUe) The (d) in (aTUe)

5)

In an attribute grammar each production rule(N--> a) has a corresponding attribute evaluation rule that describes how to compute the values of the _______attributes of each particular node N in the AST.

1.

Synthesized page no : 92

2. Complete 3. Free 4. Bounded

6)

handle from the following?

1.

The whole string, (aTUe) Page no : 68

2. The whole string, (aTbcde) 3. The whole string, (aTde) 4.

7)

When constructing an LR(1) parser we record for each item exactly in which context it appears, which resolves many conflicts present in _______parsers based on FOLLOW sets.

1. SLR(1) 2. LRS(1) 3. RLS(1) 4.

8)

The ______translation statements can be conveniently specified in YACC

1.

Syntax-directed Page no : 120

2. Image-directed 3. Sign-directed 4.

9)

We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.

1. Epsilon 2. 3.

$ Page no : 65

4.

10)

Grammars with LL(1) conflicts can be made LL(1) by applying left-factoring, substitution, and left-recursion removal. Left-factoring takes care of ________conflicts.

1. FIRST/FIRST 2. FIRST/SECOND 3. SECOND/FIRST 4.

11)

When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.

1.

E (empty string) Page no : 18

2. 3. 4.

12)

Bottom-up parsers handle a _________________ class of grammars.

1.

large Page no : 63

2. small 3. medium 4.

13)

Let a grammar G = (Vn, Vt, P, S) is modified by adding a unit production S’--> S to the grammar and now starting non-terminals becomes S’ and grammar becomes G’ = (Vn U {S’}, Vt, P U{S’ --> S}, S’). The Grammar G’ is called the -----------

1.

Augmented Grammar Page no : 76

2. Lesser Grammar 3. Anonymous Grammar 4.

14)

The LR (1) items are used as the states of a finite automaton (FA) that maintains information about the parsing stack and progress of a shift-reduce parser.