Compiler Design · Quiz 2 · May 2026

Consider the regular language

over the alphabet

Which of the following strings belong to

? (Select all that apply.)

A lexical analyzer uses the following rules.

The keyword rule has **higher priority** than the identifier rule. Input

Which of the following gives the correct number of **Keyword**, **Identifier**, and **Number** tokens?

Convert the following infix expression to postfix notation:

Which one of the following is the correct postfix expression?

A parser generator performs the following steps: 1. Construct the canonical LR(1) collection of item sets. 2. Merge all states having the same LR(0) core. 3. Construct the ACTION and GOTO tables from the merged automaton. Which parsing technique is obtained after these steps?

Consider the grammar

The initial state is

Which of the following is GOTO(I0, b) ?

Consider the grammar:

A shift-reduce parser is parsing the input:

The parser has already performed the following actions:

What should be the **next action**?

Consider the production

The semantic rules are

Which of the following is the **minimum valid attribute evaluation sequence**?

Consider the following overloaded functions.

The compiler evaluates the following function calls.

Which **one** of the following function calls requires **integer promotion** before overload resolution selects the best match?

An embedded SDT contains the production

To convert it into an equivalent postfix SDT while preserving the execution point of the action

, which of the following transformations is correct?

Consider the alphabet

Consider the following operator grammar:

An operator-precedence parser is used to parse the expression

using the following precedence and associativity rules: •

has higher precedence than

. • Both operators are left associative . Ignoring the end marker

, how many reduce operations are performed by the parser while parsing the expression?

Consider the grammar

and the following recursive descent parser.

Assume that: • Parsing starts by calling

. •

consumes the current input symbol only if it matches the expected symbol. • Any call that reports an error (i.e., executes

) immediately causes the parse to fail, even if the final lookahead is

. • After

returns, the input is accepted only if no error has been reported and the current lookahead is

. Which of the following input strings is/are accepted?

A context-free grammar contains the productions

Which language is generated?

Consider the following statements about SLR(1), Canonical LR(1), and LALR(1) parsers. 1. Every SLR(1) grammar is also an LALR(1) grammar. 2. Every LALR(1) grammar is also an LR(1) grammar. 3. Every LR(1) grammar is also an LALR(1) grammar. Which of the following is correct?

Consider the grammar.

Which of the following correctly gives **FIRST(S)** and **FOLLOW(X)**?

A student wants the exponentiation operator (

) to have higher precedence than multiplication. They write the following Bison declarations.

For the expression

which of the following statements are correct? (Select all that apply.)

Consider the SDD.

Which of the following statements are correct?