COMPILER DESIGN LAB QUIZ

COMPILER DESIGN LAB QUIZ

University

5 Qs

quiz-placeholder

Similar activities

COMANDOS DE NAVEGAÇÃO DO NVDA

COMANDOS DE NAVEGAÇÃO DO NVDA

University

10 Qs

Avaliação Laboratório de Software e WEB

Avaliação Laboratório de Software e WEB

University

10 Qs

Ομάδα 5 "Web 2.0 εργαλεία": Πόσο καλά τα γνωρίζετε;"

Ομάδα 5 "Web 2.0 εργαλεία": Πόσο καλά τα γνωρίζετε;"

10th Grade - University

10 Qs

Data Science

Data Science

University

10 Qs

Semana do Calouro

Semana do Calouro

University

10 Qs

Quiz3_DivideConquer_GreedyApproach

Quiz3_DivideConquer_GreedyApproach

University

10 Qs

Python with DataScience

Python with DataScience

7th Grade - University

10 Qs

¿Cuánto sabes sobre la tecnología que cambia al mundo?

¿Cuánto sabes sobre la tecnología que cambia al mundo?

University

10 Qs

COMPILER DESIGN LAB QUIZ

COMPILER DESIGN LAB QUIZ

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

J Badajena

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

5 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the grammar E -> E + id | E × id | id. For a sentence id +id × id the handles in the right sentential form of the reduction are

Id, E + id and E + E × id

Id, E + id and E + id × id

Id, E + id and E × id

id, id + id and id + id × id

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Let SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:

n1 is necessarily less than n2

n1 is necessarily equal to n2

n1 is necessarily greater than n2

None of the given options

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?

SLR, LALR

SLR, Canonical LR

LALR, Canonical LR

None of the given options

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which is permanent database in the general model of a compiler?

Terminal table

Identifier table

Literal table

Reduction Table

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which variable does not drive a terminal string in grammar?S→AB ,A→a,B→b,B → C

A

B

C

S

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?