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
Consider the grammar given below T-> Ta|epsilon ,E-> T|E;T , S-> E#. ?
insu_prince
asked
in
Compiler Design
May 19, 2022
282
views
0
votes
0
votes
The above grammar is
slr(1) ,lr(0) ?
insu_prince
asked
in
Compiler Design
May 19, 2022
by
insu_prince
282
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
Slr(1)
akashbadhautiya
answered
Dec 2, 2023
by
akashbadhautiya
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
3
answers
1
spriti1991
asked
in
Compiler Design
Mar 18, 2015
2,427
views
Consider the SDT , where S ->TR, R-> +TR|empty {print ("+")} , And T-> num {print(num)} And if the input is given "9+5+2" What is output ?
spriti1991
asked
in
Compiler Design
Mar 18, 2015
by
spriti1991
2.4k
views
compiler-design
syntax-directed-translation
1
vote
1
vote
0
answers
2
prayas
asked
in
Compiler Design
Jan 3, 2018
1,421
views
Consider the below grammar : S -> AaAb | BbBa A -> ɛ B -> ɛ The grammar is :
prayas
asked
in
Compiler Design
Jan 3, 2018
by
prayas
1.4k
views
0
votes
0
votes
0
answers
3
ahmed65956
asked
in
Compiler Design
Sep 27, 2023
582
views
10. Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9
ahmed65956
asked
in
Compiler Design
Sep 27, 2023
by
ahmed65956
582
views
syntax-directed-translation
computer-networks
packet-switching
routing
theory-of-computation
2
votes
2
votes
1
answer
4
Ashwani Kumar 2
asked
in
Compiler Design
Apr 20, 2016
12,514
views
S-> iEtSS'|a S-> eS|epsilon E->b
The LL(1) parsing table for the above grammar is Nonterminal a b e i t ... WHY we always choose S' ->eS production to remain in this parse table why not S' -> epsilon? Answer this..???
Ashwani Kumar 2
asked
in
Compiler Design
Apr 20, 2016
by
Ashwani Kumar 2
12.5k
views
compiler-design
parsing
ll-parser
ambiguous-grammar
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
