Compiler Design Quiz

In operator precedence parsing, the shift and reduce operations are done based on the priority between:

• The symbols referred by stack[top] and stack[top-1]

• The symbol referred by stack[top] and the current input symbol

• The current input symbol and the immediately next input symbol

• The current output symbol and the immediately next input symbol

Which of the following is true?

• * has higher precedence than +

• - has higher precedence than *

• + and / have same precedence

• + has higher precedence than *

Which of the following function is used to calculate the canonical collection of LR(0) items?.

• FIRST

• GOTO

• COMPUTE

• FOLLOW als

The parser which has higher number of states is

• SLR

• CLR

• LALR

• No relation can be referred to.

Which part of the compiler highly used the grammar concept?

• Code optimization

• Code generation

• Parser

• Lexical Analysis

Grammar that produces more than one leftmost or rightmost parse tree for same sentence is ___________

• Ambiguous

• Unambiguous

• Complementation

• Concatenation Intersection

In which parsing, the parser constructs the parse tree from the start symbol and transforms it into the input String?

• Bottom Up Parsing

• Top-down parsing

• None of the above

• Both a and b

Which phenomenon happens when the non-terminal on the left side is repeated as the first symbol on the right side?

• Left-most derivation

• Left recursion

• Left factoring

• Left parsing

Which of the following is true about left factoring

• It is the process of factoring out of common prefixes of production rules

• It is the process of factoring out of common suffixes of production rules

• It is the process of factoring out of terminals of production rules

• It is the process of factoring out of terminals of production rules

Leaf nodes in a parse tree indicate

• sub-terminals

• half-terminals

• non-terminals

• terminals