GATE CSE 2006 | Parsing Question 43 | Compiler Design

Compiler Design

Lexical Analysis

Marks 1 Marks 2

Parsing

Marks 1 Marks 2 Marks 5

Syntax Directed Translation

Marks 1 Marks 2

Code Generation and Optimization

Marks 1 Marks 2

Previous Next

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

In the correct grammar of the previous question, what is the length of the derivation (number of steps starring from S) to generate the string $${a^l}{b^m}$$ with $$l \ne m$$?

$$\max (l,m) + 2$$

$$l + m + 2$$

$$l + m + 3$$

$$\max (l,m) + 3$$

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Which one of the following grammars generates the following language?

$$L = \left( {{a^i}{b^j}|i \ne j} \right)$$

$$\eqalign{ & S \to AC\,|\,CB \cr & C \to aCb\,|\,a\,|\,b \cr & A \to aA\,|\, \in \cr & B \to Bb\,|\, \in \cr} $$

$$S \to aS\,|\,Sb\,|\,a\,|\,b$$

$$\eqalign{ & S \to AC\,|\,CB \cr & C \to aCb\,|\, \in \cr & A \to aA\,|\, \in \cr & B \to Bb\,|\, \in \cr} $$

$$\eqalign{ & S \to AC\,|\,CB \cr & C \to aCb\,|\, \in \cr & A \to aA\,|\,a \cr & B \to Bb\,|\,b \cr} $$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Consider the grammar

$$S \to \left( S \right)\,|\,a$$

Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n₁, n₂ and n₃ respectively.

The following relationship holds good

n₁ < n₂ < n₃

n₁ = n₃ < n₂

n₁ = n₂ = n₃

n₁ ≥ n₃ ≥ n₂

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Consider the grammar

$$E \to E + n\,|\,E \times n\,|\,n$$

For a sentence n + n × n, the handles in the right-sentential form of the reduction are

n, E + n and E + n × n

n, E + n and E + E × n

n, n + n and n + n × n

n, E + n and E × n

Previous Next

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Digital Logic

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages

Computer Organization