Which of the following parsing techniques attempts to construct a parse tree from the root down to the leaves? A) Top-down B) Bottom-up C) Shift-reduce D) Predictive

A) Top-down

Fill in the blank: The construction of a predictive parser is aided by two functions associated with a grammar G: ______ and FOLLOW.

FIRST

True or False: A grammar is LL(1) if it has multiple entries in the parsing table.

False. An LL(1) grammar cannot have multiple entries in the parsing table.

What is the primary difference between LL and LR parsers?

LL parsers are top-down parsers, while LR parsers are bottom-up parsers.

Riddle: I’m a structure that represents the syntactic structure of a string according to a grammar, with nodes that can be terminals or non-terminals. What am I?

Parse tree

Fill in the blank: The algorithm for constructing an SLR parsing table requires the computation of ______ items.

LR(0)

Which parsing method is known for being the most powerful but also the most complex to implement by hand? A) LL B) SLR C) CLR D) LALR

C) CLR

True or False: Left recursion in a grammar can lead to infinite loops in top-down parsers.

True

What type of grammar transformation is used to eliminate ambiguity caused by common prefixes?

Left factoring

Fill in the blank: The ______ parsing technique uses a stack to hold grammar symbols and an input buffer to hold the string to be parsed.

Shift-reduce