Compilers Top Down Parsing 1 Online Exam Quiz
Compilers Top Down Parsing 1 GK Quiz. Question and Answers related to Compilers Top Down Parsing 1. MCQ (Multiple Choice Questions with answers about Compilers Top Down Parsing 1
Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.
Options
A : 200
B : 180
C : 160
D : 40
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?
Options
A : Assembly
B : Parsing
C : Relocation
D : Symbol resolute
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.
Options
A : Edit time
B : Compile time
C : Link time
D : Load time
Which of the following derivations does a top-down parser use while parsing an input string?
Options
A : Leftmost derivation
B : Leftmost derivation in reverse
C : Rightmost derivation
D : Rightmost derivation in reverse
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
Options
A : n1 is necessarily less than n2
B : n1 is necessarily equal to n2
C : n1 is necessarily greater than n2
D : none of the mentioned
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
Options
A : Removing left recursion only
B : Factoring the grammar alone
C : Factoring & left recursion removal
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Syntax Directed Definitions Translations 1
Compilers Syntax Directed Definitions Translations 2
Compilers Three Address Statements 1
Compilers Three Address Statements 2
Compilers Transformation From Nfa Dfa 1
Compilers Transformation From Nfa Dfa 2