GATE CSE 1995 | Lexical Analysis Question 12 | Compiler Design

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)^*}$$

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

Which of the following strings can definitely be said to be tokens without looking at the next input character while compiling a Pascal program?

I. begin
II. program
III. <>

III

All of the above

GATE CSE 1990

MCQ (Single Correct Answer)

-0.3

Match the following:

List - I

(a) Lexical Analysis
(b) Code Optimization
(c) Code Generation
(d) Abelian Group

List - II

(p) DAG's
(q) Syntax trees
(r) Push Down automata
(s) Finite automata

a - s, b - p, c - q, d - r

a - r, b - p, c - q, d - s

a - s, b - q, c - p, d - r

a - s, b - p, c - r, d - q

GATE CSE 1988

MCQ (Single Correct Answer)

-0.3

In a compiler the module that checks every character of the source text is called:

The code generator

The code optimizer

The lexical analyzer

The syntax analyzer

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

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Computer Organization

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

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

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