Test: Top Down Parsing - Computer Science Engineering (CSE) MCQ
10 Questions MCQ Test Compiler Design - Test: Top Down Parsing
Which of the following derivations does a top-down parser use while parsing an input string?
The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called
| 1 Crore+ students have signed up on EduRev. Have you? Download the App |
Which of the following grammar rules violate the requirements of an operator grammar?
(i) P -> QR
(ii) P -> QsR
(iii) P -> ε
(iV) P -> QtRr
Consider the grammar with the following translation rules and E as the start symbol.
E → E1 # T { E.value = E1.value * T.value }
| T{ E.value = T.value }
T → T1 & F { T.value = T1.value + F.value }
| F{ T.value = F.value }
F → num { F.value = num.value }
Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.
Given the following expression grammar:
E -> E * F | F + E | F
F -> F - F | id
which of the following is true?
Consider a program P that consists of two source modules M1(contains reference to a function defined in M2) and M2 contained in two different files. If M1 contains a reference to a function defined in M2, the reference will be resolved at
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
Which of the following describes a handle (as applicable to LR-parsing) appropriately?
|
26 videos|66 docs|30 tests
|
|
26 videos|66 docs|30 tests
|
Top Courses for Computer Science Engineering (CSE)
Important Questions for Top Down Parsing
Top Down Parsing MCQs with Answers
Online Tests for Top Down Parsing Compiler Design
|
© EduRev
|
Education Revolution
|
|
