GATE CSE 2003 | Parsing Question 54 | Compiler Design

PREVIOUS NEXT

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

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Which of the following statements is true?

SLR parser is more powerful than LALR

LALR parser is more powerful than Canonical LR parser

Canonical LR parser is more powerful than LALR parser.

The parsers SLR, Canonical CR, and LALR have the same power

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 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

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 Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory