GATE CSE 2003 | Parsing Question 49 | 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 2003

MCQ (Single Correct Answer)

-0.3

In a bottom-up evaluation of a syntax directed definition, inherited attributes can

always be evaluated

be evaluated only if the definition is L- attributed

be evaluated only if the definition has synthesized attributes

never be evaluated

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

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

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

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory 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