Quiz on Parsing and Context-Free Grammar

Which of the following is a characteristic of context-free grammar?

• It can generate all possible strings in a language

• It requires context to understand the syntax

• It is only applicable to programming languages

• It cannot define recursive structures

Which of the following is an example of a nonterminal symbol?

• 2

• expr

• print

• if

What does it mean for a grammar to be ambiguous?

• It has multiple valid parse trees for the same string

• It cannot generate any strings

• It has a single parse tree for every string

• It is too complex to analyze

What is left recursion in grammar?

• A way to eliminate ambiguity

• A type of operator precedence

• A method of parsing from the left side of the string

• A situation where a nonterminal refers to itself on the left

Which of the following describes left associativity?

• Operators have equal precedence

• Operators are evaluated from left to right

• Operators are evaluated based on their type

• Operators are evaluated from right to left

What is a predictive parser?

• A parser that generates random outputs

• A parser that predicts the output of a program

• A parser that does not require backtracking

• A parser that uses backtracking

Which of the following is NOT a type of parser?

• Top-down parser

• Bottom-up parser

• Left-right parser

• Universal parser

What is the first step in top-down parsing?

• Construct the parse tree

• Scan the input string

• Begin with the start symbol

• Select a production for a nonterminal

What is the significance of the lookahead symbol in predictive parsing?

• It determines the next production to use

• It indicates the end of the input

• It is used to backtrack in parsing

• It is irrelevant to the parsing process