CS606 Quiz 3 Dec 2025

Quiz 1 - CS606

Question:

Which direction does a bottom-up parser use to build the parse tree?

1. From the left to the right.
2. From the root to the leaves.
3. From the leaves to the root.
4. From the right to the left.

Correct answer: From the leaves to the root.

Copied: 12/30/2025, 8:31:56 PM

Quiz 2 - CS606

Question:

In an LR(1) parser, which of the following actions consumes the input (i.e., advance the input by consuming the current token)?

1. Error
2. Shift
3. Reduce
4. Accept

Correct answer: Shift

Copied: 12/30/2025, 8:32:12 PM

Quiz 3 - CS606

Question:

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

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

Copied: 12/30/2025, 8:32:27 PM

Quiz 4 - CS606

Question:

In Shift-Reduce parser, the handle-recognizing DFA is basically represented as a 2-dimensional table, where ____________ correspond to terminals and non-terminals.

A. Captions

B. Columns

C. Rows D. Cells Copied: 12/30/2025, 8:32:41 PM

Quiz 5 - CS606

Question:

In compiler construction, an LR parser is a type of:

A. Bottom-up parser

B. Non-recursive parser C. Top-down parser D. Recursive descent parser Copied: 12/30/2025, 8:32:59 PM

Quiz 6 - CS606

Question:

If the parsing loop terminates without encountering any errors, then the parsing process is considered as successful.

A. True

B. False Copied: 12/30/2025, 8:33:18 PM

Quiz 7 - CS606

Question:

In the context of Shift-Reduce parser, the number of complete handles is equal to the number of ____________.

A. Terminals B. Symbols C. Non-terminals

D. Productions

Copied: 12/30/2025, 8:33:29 PM

Quiz 8 - CS606

Question:

�A�f�t�e�r� �p�e�r�f�o�r�m�i�n�g� �l�e�f�t� �f�a�c�t�o�r�i�n�g� �o�n� �t�h�e� �g�r�a�m�m�a�r� �"�S� !’� �a� �X� �|� �a�"�,� �t�h�e� �r�e�s�u�l�t�a�n�t� �g�r�a

�A�.� �S� !’� �S�'� �a�,� �S�'!’� �X� �|� µ �B�.� �S� !’� �X� �a�,� �S�'!’� �S� �|� µ