PREVIOUS NEXT
1
GATE CSE 2019
Numerical
+1
-0
Consider the grammar given below:

S → Aa

A → BD

B → b | ε

D → d | ε

Let a, b, d, and $ be indexed as follows: GATE CSE 2019 Compiler Design - Parsing Question 22 English
Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, $}, then the answer should be 3210)
Your input ____
2
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
3
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$$
4
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is TRUE at any valid state in shift-reduce parsing?
A
Viable prefixes appear only at the bottom of the stack and not inside
B
Viable prefixes appear only at the top of the stack and not inside
C
The stack contains only a set of viable prefixes
D
The stack never contains viable prefixes
PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability 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
P and NP Concepts Searching and Sorting Greedy Method Dynamic Programming Complexity Analysis and Asymptotic Notations Divide and Conquer Method
Digital Logic
Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems
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 Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security
Software Engineering
Software Engineering
Compiler Design
Syntax Directed Translation Parsing Lexical Analysis Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Logical Reasoning Numerical Ability
Discrete Mathematics
Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus
Programming Languages
Basic of Programming Language Pointer and Structure in C Function and Recursion
Computer Organization
Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory
EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination
JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)
Medical
NEET AIIMS MHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12