CS606 Final Term Solved MCQs with References

CS606- compiler instruction · Solved MCQS · From Midterm Papers · Feb 25,2013 · PSMD01

More Files Visit

Final Term MCQ’s and Quizzes

CS606- compiler instruction

If X is a terminal in A--> aX•?, then this transition corresponds to a shift of ____ from input to top of parse stack.

X A a

A canonical collection of sets of items for an augmented grammar, C is constructed as -----

The first set in C is the closure of {[S' --> .S]}, where S is starting symbol of original grammar and S' is the starting non-terminal of augmented grammar. The first set in C is the closure of {[S' --> .S]}, where S is starting symbol of original grammar and S' is the starting non-terminal of original grammar. The first set in C is the closure of {[S' --> .S]}, where S is starting symbol of original grammar and S is the starting non-terminal of augmented grammar. None of these

An ----- does not need to examin the entire stack for a handle, the state symbol on the top of the stack contains all the information it needs.

LR parser RL parser BU parser Suppose ? begins with symbol X which may be a terminal (token) or non-terminal. The item can be written as A? Xa•?.

True False

YACC parser generator builds up

SLR parsing table Canonical LR parsing table LALR parsing table

LR(1) parsing is --- base parsing.

DFA CFG PDA

The LR(1) parsers can not recognize precisely those languages in which one-symbol lookahead suffices to determine whether to shift or reduce.

True False

Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.

Shift action Reduce action Shift and reduce actions De-allocation of memory S --> A | xb A --> aAb | x This grammar contains a reduce-reduce conflict.

True

False

S --> a | B B --> Bb | E The non-terminal _______ is left recursive.

B

a E

Following statement represents: if x relop y goto L

abstract jump Conditional jump While loop

When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.

Character Grammar Token Sentence

Left factoring is enough to make a grammar LL(1).

True False