UNIT - 2 C Bottom-Up Parsing Quiz

What is the main goal of bottom-up parsing?

• Build the parse tree from root to leaves

• Build the parse tree from leaves to root

• Generate tokens from the source code

• Optimize the intermediate code

Which of the following is a bottom-up parsing technique?

• Recursive descent parsing

• Predictive parsing

• Shift-reduce parsing

• LL(1) parsing

Bottom-up parsers work on the principle of:

• Deriving the string using rightmost derivation in reverse

• Deriving the string using leftmost derivation

• Directly generating machine code

• Constructing intermediate code

What is the primary advantage of bottom-up parsing?

• Simplicity in implementation

• Handles all types of context-free grammars

• Eliminates the need for lookahead tokens

• Works efficiently with ambiguous grammars

Which data structure is primarily used in bottom-up parsing?

• Queue

• Stack

• Array

• Tree

What does the "shift" operation do in shift-reduce parsing?

• Removes an element from the stack

• Pushes an input symbol onto the stack

• Pops the top of the stack and reduces it

• Signals the end of parsing

What does the "reduce" operation do in shift-reduce parsing?

• Pushes an input symbol onto the stack

• Combines stack symbols to form a non-terminal

• Removes a terminal from the input

• Optimizes the parse tree

What is a handle in shift-reduce parsing?

• A token being processed

• A substring that matches the right-hand side of a production rule

• The root of the parse tree

• A terminal symbol

Which of the following is NOT a conflict in shift-reduce parsing?

• Shift-shift conflict

• Shift-reduce conflict

• Reduce-reduce conflict

• None of the above

Which grammars are suitable for shift-reduce parsers?

• Context-sensitive grammars

• Context-free grammars

• Regular grammars

• Ambiguous grammars