Compiler Quiz on Parsers

Compiler Quiz on Parsers

University

5 Qs

quiz-placeholder

Similar activities

CD program 5

CD program 5

University

4 Qs

Syntax Testing

Syntax Testing

University

10 Qs

Viva - Practical - Main

Viva - Practical - Main

University

10 Qs

Compiladores - U1 S3

Compiladores - U1 S3

University

10 Qs

TOC_CSE-3_LA-1

TOC_CSE-3_LA-1

University

10 Qs

Axios in Vue 3

Axios in Vue 3

12th Grade - University

10 Qs

Chapter 4​ Lexical and Syntax Analysis- Part 1​

Chapter 4​ Lexical and Syntax Analysis- Part 1​

University

5 Qs

Digital Electronics Weekend Assignment 5

Digital Electronics Weekend Assignment 5

University - Professional Development

10 Qs

Compiler Quiz on Parsers

Compiler Quiz on Parsers

Assessment

Quiz

Computers

University

Hard

Created by

vijay vasanth

Used 2+ times

FREE Resource

AI

Enhance your content

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

Given the following expression grammar:            

E -> E * F | F + E | F

F -> F - F | id

which of the following is true?

 

       * has higher precedence than +

- has higher precedence than *

+' has higher precedence

+' has higher precedence than *

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following derivations does a bottom up parser use while parsing an input string?

Leftmost derivation  

Leftmost derivation in reverse

Rightmost derivation

Rightmost derivation in reverse

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

Canonical LR, LALR

SLR, canonical LR

LALR, canonical LR

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is correct?

r?  = r . R

r?  = r / έ

r?  = r / r*

r?  =  r .  r*

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A form of recursive-descent parsing that does not require any back-tracking is known as?

predictive parsing

non-predictive parsing

recursive parsing  

non-recursive parsing