Compiler Design unit 1 Quiz

Compiler Design unit 1 Quiz

University

20 Qs

quiz-placeholder

Similar activities

Final Term - Quiz No. 4: Asphaltic Materials

Final Term - Quiz No. 4: Asphaltic Materials

University

15 Qs

DLD Unit 1 _ 2

DLD Unit 1 _ 2

University

20 Qs

Quiz Manajemen Operasi

Quiz Manajemen Operasi

University

15 Qs

Cuestionario sobre IA en Construcción

Cuestionario sobre IA en Construcción

University

16 Qs

Quiz Protokol Komunikasi IoT

Quiz Protokol Komunikasi IoT

University

20 Qs

English for Engineering Part 2

English for Engineering Part 2

University

15 Qs

Simple and Compound Machines

Simple and Compound Machines

7th Grade - University

15 Qs

WEEK11-12 Flyback,PF, Half-Bridge

WEEK11-12 Flyback,PF, Half-Bridge

University

17 Qs

Compiler Design unit 1 Quiz

Compiler Design unit 1 Quiz

Assessment

Quiz

Engineering

University

Practice Problem

Hard

Created by

Kalpana Gilda

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...

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Match all items in Group 1 with correct options from those given in Group 2.

P-4. Q-1, R-2, S-3

P-3, Q-1, R-4, S-2

P-3, Q-4, R-1, S-2

P-2, Q-1, R-4, S-3

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which data structure in a compiler is used for managing information about variables and their attributes?

Abstract syntax tree

Symbol table

Semantic stack

Parse table

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a compiler, keywords of a language are recognized during

parsing of the program

the code generation

the lexical analysis of the program

dataflow analysis

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

The set of all strings containing the substring 00.

The set of all strings containing at most two 0's.

The set of all strings containing at least two 0's.

The set of all strings that begin and end with either 0 or1

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

S ->aSa| bSb| a| b ;The language generated by the above grammar over the alphabet {a,b} is the set of

All palindromes

All odd length palindromes

Strings that begin and end with the same symbol

All even length palindromes

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Finite state automata

Deterministic pushdown automata

Non-Deterministic pushdown automata

Turing machine

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not performed during compilation?

Dynamic memory allocation

Type checking

Symbol table management

inline expression

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?