Figure-out the case from the following in which the

Data flow analysis is a technique used by optimizers to:

In a compiler, lexical analysis is responsible for:

Which of the following is NOT a common form of 3-address code?

Which technique is used to handle left recursion in a grammar?

In a Syntax-Directed Definition (SDD), attributes are associated with:

If an expression `x = a + b` is computed, and later in the same basic block, `y = a + b` is computed, a compiler can apply which optimization?

Which of the following tools is commonly used to generate a lexical analyzer (scanner) from a set of regular expressions?

Which parsing method uses a stack and an input buffer?

Which of these is used for resolving operator precedence in parsing?

What is the primary output of the parsing phase in a compiler?