Skip to content
VUBuddy

CS606 Quiz 3 by VU Topper RM

Compiler Construction PDF 158 KBUpdated 23 Oct 2026
Quiz CS606 Quiz 3 by VU Topper RM PDF 158 KB
vubuddy.com
Type
Quiz
Course
CS606 Compiler Construction
Size
PDF 158 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 158 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 8. Download the file for all 8 pages.

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

A. Production and symbol tables B. First and follow tables C. Closure and reduction tables D.

Action and goto tables

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

A. A set of LR items representing the states of the parser during parsing. B. A table used for storing parsing actions. C. The final output of the parsing process. D. A list of production rules in a grammar.

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

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.

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 In the LR table, how are the entries other than the state containing [S' → •S, $] initialized? A. Marked as "accept" B. Assigned with reduce actions C. Marked as "error" D.

Assigned with shift actions

Left factoring is primarily used in which type of parsing?

A.

Predictive parsing

B. Bottom-up parsing C. Shift-Reduce parsing D.

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

A. The non-terminal on the left-hand side of the production rule. B. The last symbol in the input string. C. D. The lookahead symbol.

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

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

A. Add the item to the closure set. B. Identify the symbols immediately following the dot in the item. C. Compute the FIRST set for the nonterminal symbol following the dot. D. Determine the lookahead symbols for the item.

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

true

B. false

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

The Upper Frontier is associated with which type of parsing algorithm? A. Top-Down B. Bottom-Down C. Top-Up D.

Bottom-Up

The upper frontier in a shift-reduce parser is the set of symbols at the top of the parser's stack that have not been reduced yet. A. true B.

All CS606 files →
CS606 Compiler Construction All CS606 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.