Compiler Design unit 1 Quiz

Compiler Design unit 1 Quiz

University

20 Qs

quiz-placeholder

Similar activities

Flue Gas Analysis

Flue Gas Analysis

University

20 Qs

Natural Language Processing CT-1

Natural Language Processing CT-1

University

20 Qs

Hackharbor 3.0 Day 3:C

Hackharbor 3.0 Day 3:C

University

20 Qs

 Pre Test Modul 7 (47-03 & 47-01)

Pre Test Modul 7 (47-03 & 47-01)

University

16 Qs

Code Sprint '25

Code Sprint '25

University

20 Qs

CODEBURST : JAVA EDITION

CODEBURST : JAVA EDITION

University

20 Qs

Verilog HDL -module 1 Quiz

Verilog HDL -module 1 Quiz

University

18 Qs

Web3 and Blockchain Challenge

Web3 and Blockchain Challenge

University

15 Qs

Compiler Design unit 1 Quiz

Compiler Design unit 1 Quiz

Assessment

Quiz

Engineering

University

Hard

Created by

Kalpana Gilda

Used 1+ times

FREE Resource

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
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?