GATE CSE 2003 | Parsing Question 53 | Compiler Design

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Assume that the SLR parser for a grammar G has n₁ states and the LALR parser for G has n₂ states. The relationship between n₁ and n₂ is

n₁ is necessarily less than n₂

n₁ is necessarily equal to n₂

n₁ is necessarily greater than n₂

None of the above

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion alone

Factoring the grammar alone

Removing left recursion and factoring the grammar

None of the above

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called

Assembly

Parsing

Relocation

Symbol resolution

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Which of the following statements is false?

An unambiguous grammar has same leftmost and rightmost derivation

An LL(1) parser is a top-down parser

LALR is more powerful than SLR

An ambiguous grammar can never be LR(k) for any k

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory