CS606 Final Term MCQs by VU Topper RM

Q1. Vu-Topper RM (1 marks)

The canonical collection is used to generate which of the following parsing tables?

1. Production and symbol tables
2. First and follow tables
3. Closure and reduction tables
4. Action and goto tables

Correct answer: Action and goto tables

Q2. Vu-Topper RM (1 marks)

What does the term "canonical collection" refer to in LR parsing?

1. A set of LR items representing the states of the parser during parsing.
2. A table used for storing parsing actions.
3. The final output of the parsing process.
4. A list of production rules in a grammar.

Correct answer: A set of LR items representing the states of the parser during parsing.

Q3. Vu-Topper RM (1 marks)

In LR grammar, the R stands for ________________. A. Right shift

B. Right to left scan

C. Right most derivation D. Right hand side of grammar

Q4. Vu-Topper RM (1 marks)

The NFA of LR(0) items represents transitions between: A. LR(1) items. B. LR(0) items without considering lookahead symbols. C. Grammar symbols and their derivations. D. Non-terminal symbols and their productions.

Q5. Vu-Topper RM (1 marks)

In the grammar "T → a b c d | a b d c", the ____________ is a common prefix for non-terminal 'T'. A. c d

B. a b

C. b d D. a c

Q6. Vu-Topper RM (1 marks)

In the LR table, how are the entries other than the state containing [S' → •S, $] initialized?

1. Marked as "accept"
2. Assigned with reduce actions
3. Marked as "error"
4. Assigned with shift actions

Correct answer: Assigned with shift actions

Q7. Vu-Topper RM (1 marks)

Left factoring is primarily used in which type of parsing?

1. Predictive parsing
2. Bottom-up parsing
3. Shift-Reduce parsing
4. LR parsing

Correct answer: Predictive parsing

Q8. Vu-Topper RM (1 marks)

In the handle representation <A → α, k>, what does A represent?

1. The non-terminal on the left-hand side of the production rule.
2. The last symbol in the input string.
3. The position of the handle within the input string.
4. The lookahead symbol.

Correct answer: The non-terminal on the left-hand side of the production rule.

Q9. Vu-Topper RM (1 marks)

The output from the algorithm for the construction of collection of canonical sets of LR(1) items is _______________.

A. CC sets of LR(1)

B. Original Grammar G C. CC sets of LR(0) D. Augmented Grammar G'

Q10. Vu-Topper RM (1 marks)

Which of the following is NOT a step in the closure procedure for an LR item?

1. Add the item to the closure set.
2. Identify the symbols immediately following the dot in the item.
3. Compute the FIRST set for the nonterminal symbol following the dot.
4. Determine the lookahead symbols for the item.

Correct answer: Compute the FIRST set for the nonterminal symbol following the dot.

Q11. Vu-Topper RM (1 marks)

The augmented grammar has its own start symbol, while original grammar includes an additional production rule, called the augmented start production.

True

False

Q12. Vu-Topper RM (1 marks)

In Shift-Reduce parser, the handle-recognizing DFA is basically represented as a 2-dimensional table, where ____________ correspond to DFA states. A. Cells

B. Rows

C. Captions D. Columns