ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following kinds of derivation is used by LR parsers?
A
Rightmost
B
Leftmost in reverse
C
Rightmost in reverse
D
Leftmost
2
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Match the following:

GROUP - 1 GROUP - 2
(P) Lexical analysis (i) Leftmost derivation
(Q) Top down parsing (ii) Type checking
(R) Semantic analysis (iii) Regular expressions
(S) Runtime environments (iv) Activation records

A
$$P \leftrightarrow i,\,\,Q \leftrightarrow ii,\,\,R \leftrightarrow iv,\,\,S \leftrightarrow iii$$
B
$$P \leftrightarrow iii,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iv$$
C
$$P \leftrightarrow ii,\,\,Q \leftrightarrow iii,\,\,R \leftrightarrow i,\,\,S \leftrightarrow iv$$
D
$$P \leftrightarrow iv,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iii$$
3
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Among simple $$LR (SLR) ,$$ canonical $$LR,$$ and look-ahead $$LR$$ $$(LALR),$$ which of the following pairs identify the method that is very easy to implement and the method that is the most powerful , in that order?
A
$$SLR, LALR$$
B
Canonical $$LR,$$ $$LALR$$
C
$$SLR,$$ canonical $$LR$$
D
$$LALR,$$ canonical $$LR$$
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Match the following:
GROUP 1 GROUP 2
P. Lexical analysis 1. Graph coloring
Q. Parsing 2. DFA minimization
R. Register allocation 3. Post-order traversal
S. Expression evaluation 4. Production tree
A
$$P - 2,\,\,Q - 3,\,\,R - 1,\,\,S - 4$$
B
$$P - 2,\,\,Q - 1,\,\,R - 4,\,\,S - 3$$
C
$$P - 2,\,\,Q - 4,\,\,R - 1,\,\,S - 3$$
D
$$P - 2,\,\,Q - 3,\,\,R - 4,\,\,S - 1$$
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
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
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
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
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEEAP EAPCET
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12