GATE CSE 2009 | Lexical Analysis Question 7 | Compiler Design

PREVIOUS NEXT

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

Match all items in Group 1 with correct options from those given in Group 2.

Group 1

P. Regular expression
Q. Pushdown automata
R. Dataflow analysis
S. Register allocation

Group 2

1. Syntax analysis
2. Code generation
3. Lexical analysis
4. Code optimization

P - 4. Q - 1, R - 2, S - 3

P - 3, Q - 1, R - 4, S - 2

P - 3, Q - 4, R - 1, S - 2

P - 2, Q - 1, R - 4, S - 3

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

The number of tokens in the following C statement is:

printf("i = %d, &i = %x",i, &i);

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Type checking is normally done during

Lexical analysis

Syntax analysis

Syntax directed translation

Code optimization

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

In some programming languages, an identifier is permitted to be a letter following by any number of letters or digits. If L and D denote the sets of letters and digits respectively, which of the following expressions defines an identifier?

$${\left( {L \cup D} \right)^ + }$$

$$L{\left( {L \cup D} \right)^*}$$

$${\left( {L.D} \right)^*}$$

$$L{\left( {L.D} \right)^*}$$

PREVIOUS NEXT

GATE CSE Subjects

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

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 File System IO and Protection Deadlocks Memory Management

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

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

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability