Crowdly

Add to Chrome

Universities
lms.vit.ac.in
Compiler Design(BCSE307L)

Compiler Design(BCSE307L)

Looking for Compiler Design(BCSE307L) test answers and solutions? Browse our comprehensive collection of verified answers for Compiler Design(BCSE307L) at lms.vit.ac.in.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

Consider the

following statements:

I:

Every SLR(1) grammar is unambiguous but

there are certain unambiguous grammars that

are not SLR(1).

II:

For any context-free grammar, there is a

parser that takes at most O(n

³) time to parse a

string of length

n.

Which of the

following option is correct?

I is true and II is false

I is false and II is false

I is true and II is true

I is false and II is true

View this question

If a “Three Address Code” consists of

Two operands and one res

Two operands and one

operator

One operand and two

operators

None of the answer

View this question

Which one of the

following statements is FALSE?

Context-free grammar can be

used to specify both lexical and syntax rules.

Type checking is done

before parsing.

Arguments to a function can be passed using the program stack.

High-level

language programs can be translated to different Intermediate

Representations.

View this question

Which

one of the following kinds of derivation is used by LR parsers?

Rightmost

Rightmost

in reverse

Leftmost

in reverse

Leftmost

View this question

The

least number of temporary variables required to create a three-address code in

static single assignment form for the expression

a = -i + j / (3*k) + l – m * 5* n + o * p /q is

11

9

12

10

View this question

Consider the following grammar.

S → aScB / e

B → b

The

number of reduction steps taken by a bottom-up parser while accepting the

string

8

6

7

9

View this question

Quadruple is a record structure with four fields

Op1, Op2, arg2 and

result

Op, arg1, arg2 and result

All the answers

arg1, arg2, result

and Op

View this question

Three address code for the following function

call

Newton ( x1, x2, y1, y2, z1) is

param

z1 param y2 param y1

param x2 param x1

call 5, Newton

param

x1 param x2 param z1

param y1 param y2

call Newton, 5

param

x1 param x2 param y1

param y2 param z1

call Newton , 5

param

x1 param x2 param y1

param y2 param z1

call 5, Newton

View this question

Consider the grammar given below

S→ CC

C→cC / d

The grammar is

LL(1)

SLR(1)

but not LL(1)

LALR(1) but not SLR(1)

LR(1) but not LALR(1)

View this question

Consider the augmented grammar given below:

S' → S

S → S+X | X | Y

X → X*Y | Y | Y

+ Z

Z → aSb | c

Let I₀

= CLOSURE ({[S' →

•S]}). The number of items in the set GOTO (I

₀

, a

) is: ________.

6

4

5

7

View this question

1

Want instant access to all verified answers on lms.vit.ac.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome

Telegram Instagram TikTok Question Bank

Terms of Use Contact Us