Sr Parsers

Sr Parsers

University

25 Qs

quiz-placeholder

Similar activities

Energy Conservation Awareness

Energy Conservation Awareness

University

21 Qs

LDFI.....Evaluación Unidad 1

LDFI.....Evaluación Unidad 1

University

20 Qs

Natural Language Processing CT-3

Natural Language Processing CT-3

University

20 Qs

NEXUS'25

NEXUS'25

University

20 Qs

Types of Tractors

Types of Tractors

10th Grade - University

21 Qs

Green Engineering

Green Engineering

University

20 Qs

Desarrollo Aplicacion Movil I

Desarrollo Aplicacion Movil I

University

20 Qs

ELECTRICAL ENGINEERS PRE-BOARD EXAMINATION AUGUST 2013

ELECTRICAL ENGINEERS PRE-BOARD EXAMINATION AUGUST 2013

University

22 Qs

Sr Parsers

Sr Parsers

Assessment

Quiz

Engineering

University

Hard

Created by

Sindhu S

Used 2+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

  1. Consider the grammar

    S -> A

    A -> $B$ | id

    B -> B,A | A

    If I0 = CLOSURE[S -> .A] then how many items be in the set for GOTO(I0, $)

3

4

5

6

2.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Which of the following kind of derivation is used by LR parsers?

Leftmost

Leftmost in reverse

Rightmost

Rightmost in reverse

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statemnets about parser is/are correct?

I. Canonical LR is more powerful than SLR

II. SLR is more powerful than LALR

III. SLR is more powerful than Canonical LR

I only

II only

III only

II and III only

4.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Assume that the 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 options

5.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Which of the following is true for shift reduce parsers?

Scans and parses the input in one forward pass over the text, without any backup

A shift command advances in the input stream by one symbol

LALR parser

all of the mentioned

6.

MULTIPLE CHOICE QUESTION

5 sec • 1 pt

Which of the following can be a LALR parser generator?

YACC

GNU Bison

YACC and GNU Bison

None of the mentioned

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the following 2 sets of LR(1) items of an LR(1) grammar.

X -> c.X, c|d X -> c.X, $

X->.cX, c|d X->.cX, $

X->.x, c|d X->.d, $

Which of the following statements related to merging of the 2 sets in the corresponding LALR parser is/are FALSE?

  1. Cannot be merged since lookaheads are different

  2. Can be merged but will result in SR conflict

  3. Can be merged but will result in RR conflict

  4. Cannot be merged since GOTO on c will lead to two different sets

1 only

2 only

1 and 4 only

1,2,3 and 4

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?