16295030
Descripción
Test por Thomas Scott, actualizado hace más de 1 año
|
Creado por Thomas Scott
hace más de 5 años
|
|
Pregunta 1
Pregunta
Which of the following is NOT a top-down parsing?
Respuesta
-
Recursive descent parsing
-
Backtracking
-
LL(1) parsing
-
None of these
Pregunta 2
Pregunta
Which of the following is true for parser generator
Respuesta
-
The input of a parser generator is a token stream
-
The output of a parser generator is abstract syntax tree(AST)
-
CFG of a programming language is part of the input to a parser generator.
-
Flex is a parser generator
Pregunta 3
Pregunta
Which of the follwoing is NOT true for parser?
i. The parser is to process a token stream
ii. One of the major responsibilities of parser is to detect syntax errors.
iii. The output of parser is an abstract syntax tree.
Respuesta
-
i
-
i, ii
-
i, ii, iii
-
ii, iii
-
iii
-
None of the above.
Pregunta 4
Pregunta
Grammar that produce more than one parse tree for same sentence:
Respuesta
-
is ambiguous
-
is unambiguous
-
has syntax errors
-
is not LL(1) grammar
Pregunta 5
Pregunta
Which of the following is WRONG
Respuesta
-
A CFG grammar is said to be ambiguous if for a sentence, there is a leftmost derivation and a rightmost derivation
-
A DFG grammar is said to be ambiguous if for a sentence, there are two leftmost derivations.
-
A CFG grammar is said to be ambiguous if for a sentence, there are two rightmost derivations.
-
A CFG grammar is said to be ambiguous if for a sentence, there are two different parse tree representations.
Pregunta 6
Pregunta
The context free grammar S -> SS | 0S1 | 1S0| ε generates.
Respuesta
-
Equal number of 0's and 1's
-
Unequal number of 0's and 1's
-
Number of 0's followed by any number of 1's
-
None of the above.
Pregunta 7
Pregunta
Which of the following is a Tiger program with syntax errors?
Respuesta
-
1
-
"1"
-
x = 5
-
var x: int := 5
-
All of the above
Pregunta 8
Pregunta
Which of the following is a Tiger program without syntax errors?
Respuesta
-
(1, 2, 3)
-
(1; 2; 3;)
-
(1; 2; 3)
-
(1, 2, 3,)
-
None of the above
Pregunta 9
Pregunta
Which of the following is a Tiger expression with syntax errors?
Respuesta
-
a(1)
-
b[1]
-
c[2] of 3
-
(10)
-
NONE of the above
Pregunta 10
Pregunta
Which of the following derivations does a LL(1) parser use while parsing an input string? The input is assumed to be scanned in left to right order?
Respuesta
-
Leftmost derivation
-
Rightmost derivation
-
None of the above
Pregunta 11
Pregunta
Assume X (terminal or non-terminal) is the top symbol in the stack, and c is the next symbol in the input in LL(1) parsing, which of the following indicates a syntax error?
i. x is any terminal other than c
ii. x is a non-terminal, but the cell M[X,c] in the parsing table is empty
iii. x is any non-terminal other than c
iv. x is a non-terminal, but the cell M[X,c] in the parsing table is not empty
Respuesta
-
i
-
i and iii
-
i, ii, iii, and iv
-
None of the above
Pregunta 12
Pregunta
Assume FIRST(A) = {b, c, d, ε} for a non-terminal A, what's the result of FIRST(eAf) where e and f are terminals?
Respuesta
-
{b, c, d, e}
-
{b, c, d}
-
{e, f}
-
{e}
Pregunta 13
Pregunta
Assume FIRST(A) ={b, c, d, ε} for a non-terminal A, what's the result of FIRST(Ae) where e is a terminal?
Respuesta
-
{b, c , d, e}
-
{b, c, d}
-
{e}
-
{b, c, d, e, ε}
Pregunta 14
Pregunta
Assume FIRST(A) ={1, 2, ε}, and FIRST(B) = {b, d} for non- terminal A and B, what's the result of FIRST(AB)?
Respuesta
-
{b, d, ε}
-
{1, 2}
-
{b, d, 1, 2}
-
{1, 2, ε}
-
{b, d, 1, 2, ε}
Pregunta 15
Pregunta
Assume FIRST(A) ={1, 2, ε}, and FIRST(B) = {b, d} for non- terminal A and B, what's the result of FIRST(BA)?
Respuesta
-
{b, d}
-
{1, 2}
-
{b, d, 1, 2}
-
{1, 2, ε}
-
{b, d, 1, 2, ε}
Pregunta 16
Pregunta
Assume FIRST(A) ={1, 2, ε}, and FIRST(B) = {b, d, ε} for non- terminal A and B, what's the result of FIRST(BA)?
Respuesta
-
{b, d, ε}
-
{1, 2}
-
{b, d, 1, 2}
-
{1, 2, ε}
-
{b, d, 1, 2, ε}
Pregunta 17
Pregunta
Assume FOLLOW(A) ={b, d}, FIRST(B) = {1, 2}, for non-terminal A and B, which of the following statements is correct for a production: A-> ABgh where g and h are terminals?
Respuesta
-
FOLLOW(B) contains g
-
FOLLOW(B) contains h
-
FOLLOW(B) contains both g and h
-
g and h are not in FOLLOW(B)
-
FOLLOW(B) contains b, and d
Pregunta 18
Pregunta
Assume FOLLOW(A) ={b, d}, FIRST(B) = {1, 2, ε}, for non-terminal A and B, which of the following statements is correct for a production: A-> ACB where C is a non-terminal?
Respuesta
-
FOLLOW(C) contains {1, 2, ε}
-
FOLLOW(C) contains {b, d}
-
FOLLOW(C) contains {1, 2, b, d, ε}
-
FOLLOW(C) contains {1, 2, b, d}
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.