Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Compiler Design
[closed]
Kaushal Sanadhya
asked
in
Compiler Design
Sep 25, 2018
closed
Sep 25, 2018
by
Shaik Masthan
219
views
0
votes
0
votes
closed as a duplicate of:
GATE CSE 2013 | Question: 9
If the grammar is not allowed to have epsilon /unit productions then the maximum number of reduce moves which are required during bottom up evaluation of X tokens by bottom up parser is ?
compiler-design
Kaushal Sanadhya
asked
in
Compiler Design
Sep 25, 2018
closed
Sep 25, 2018
by
Shaik Masthan
by
Kaushal Sanadhya
219
views
comment
Follow
share this
share
1 comment
by
Shubhgupta
commented
Sep 25, 2018
reply
Follow
share this
https://gateoverflow.in/1418/gate2013-9
0
0
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Ebrahim
asked
in
Compiler Design
Jan 31
127
views
compiler design tcompiler-design-timothy-g-griffin
6. Generate code for the following C program using any code generation algorithm. [3 Marks] main() { int x, a, b, c, d, e; x= a + b -( c + d ) * e }
Ebrahim
asked
in
Compiler Design
Jan 31
by
Ebrahim
127
views
compiler-design
syntax-directed-translation
code-optimization
parsing
ullman
0
votes
0
votes
1
answer
2
Rohit Chakraborty
asked
in
Compiler Design
Jan 15
137
views
Made easy mock test question from Compiler Design
Please show the procedure for the given question.
Rohit Chakraborty
asked
in
Compiler Design
Jan 15
by
Rohit Chakraborty
137
views
compiler-design
parsing
made-easy-test-series
0
votes
0
votes
1
answer
3
Ebrahim
asked
in
Compiler Design
Jan 12
152
views
Compiler-design
Q1. For the following grammar N -> AB | BA A -> a | CAC B -> b | CBC C -> a | b Find the FIRST and FOLLOW
Ebrahim
asked
in
Compiler Design
Jan 12
by
Ebrahim
152
views
compiler-design
syntax-directed-translation
lexical-analysis
ullman
parsing
0
votes
0
votes
0
answers
4
Ebrahim
asked
in
Compiler Design
Jan 11
90
views
compiler-design-timothy-g-griffin
Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
Ebrahim
asked
in
Compiler Design
Jan 11
by
Ebrahim
90
views
compiler-design
parsing
ullman
syntax-directed-translation
code-optimization
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
