
Compiler Quiz on Parsers
Authored by vijay vasanth
Computers
University
Used 2+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
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
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?