3-2 CSE CT - 2

What are the two types of parsers employed?

• Top-down parser

• Bottom-up parser

• Top-down parser

  and

  Bottom-up parser

• Recursive descent Parser and

  Non-Recursive descent Parser

What does CFG stand for?

• Context-free Grammar

• Context-free Group

• Context-free Generation

• None of the above

What is the parsing table algorithm used for?

• To produce a parsing table for any grammar

• To eliminate left recursion

• To handle errors in parsing

• To construct a parse tree

What is a grammar whose parsing table has no multiply defined entries called?

• LL(1)

• LR(1)

• Ambiguous

• Left Recursive

What is the main difficulty in using predictive parsing?

• Writing a grammar for the source language

• Constructing a parse tree

• Handling left recursion

• Eliminating ambiguity

What is a handle in the context of shift-reduce parsing?

• A substring that matches the right side of a production

• The top symbol on the stack

• An input symbol

• A non-terminal in the grammar

What are the two conflicts that occur in shift-reduce parsing?

• Shift-reduce conflict and reduce-reduce conflict

• Ambiguous and left recursive conflict

• Syntax and semantic conflict

• Parsing and error recovery conflict

Syntax Analyser is also known as ___________

• Hierarchical Analysis

• Hierarchical Parsing

• None of the mentioned

• Hierarchical Analysis & Parsing

From where it takes its input from?

• Lexical analyser

• Syntactic Analyser

• Semantic Analyser

• None of the mentioned

Which of these is not true about the Symbol Table?

• All the labels of the instructions are symbols

• Table has entry for symbol name address value

• Perform the processing of the assembler directives

• Created during pass 1