Skip to content
VUBuddy

CS606 Quiz 2 May 2026

Compiler Construction PDF 35 KBUpdated 23 Oct 2026
Quiz CS606 Quiz 2 May 2026 PDF 35 KB
vubuddy.com
Type
Quiz
Course
CS606 Compiler Construction
Size
PDF 35 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 35 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 2, 5 of 5. Download the file for all 5 pages.

Quiz 1 - CS606 (Q1/10)

Question:

What happens when a parsing error occurs during non-recursive predictive parsing?

  1. The input string is rejected as invalid.
  2. The parser switches to recursive parsing mode.
  3. The parsing process restarts from the beginning.
  4. The parser automatically corrects the error.

Correct answer: The input string is rejected as invalid.

Copied: 5/18/2026, 9:04:22 AM

Quiz 2 - CS606 (Q2/10)

Question:

The parsing completion criteria in non-recursive predictive parsing include:

A. Non-empty stack and consumed input tokens B. Empty stack and remaining input tokens

C. Empty stack and consumed input tokens

D. Non-empty stack and remaining input tokens Copied: 5/18/2026, 9:04:46 AM

Quiz 3 - CS606 (Q3/10)

Question:

�T�h�e� �r�u�l�e� �"�S� !’� µ�"� �s�a�y�s� �t�h�a�t� �t�h�e� �s�y�m�b�o�l� �S� �C�A�N� �N�O�T� �b�e� �r�e�w�r�i�t�t�e�n� �a�s� �a�n� �e�m�p�t�y� �s�t�r

A. False

A. ---

B. ----

C. --

D. - Copied: 5/18/2026, 9:06:37 AM

Quiz 9 - CS606 (Q9/10)

Question:

In the context of recursive descent parser in C++, what does the condition "op == PLUS || op == MINUS" check in the isPresent() function?

  1. It validates the syntax of the expression.
  2. It verifies if the current operator is addition or subtraction.
  3. It checks if the expression is valid.
  4. It ensures the correctness of the token stream.

Correct answer: It verifies if the current operator is addition or subtraction.

Copied: 5/18/2026, 9:07:11 AM

Quiz 10 - CS606 (Q10/10)

Question:

What is the purpose of the FIRST set in LL(1) parsing?

  1. To determine the first terminal symbol in each production rule
  2. To determine the first set of all non-terminals in the grammar
  3. To determine the first set of all terminal symbols in the grammar
  4. To determine the first non-terminal symbol in each production rule

Correct answer: To determine the first terminal symbol in each production rule

Copied: 5/18/2026, 9:07:30 AM

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.