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
LR(1) doubt
Nandkishor3939
asked
in
Compiler Design
Jan 31, 2019
294
views
0
votes
0
votes
In exam if they are mentioning LR(1) parser
Then which parser to consider:
SLR(1) / LALR(1) / CLR(1)
compiler-design
Nandkishor3939
asked
in
Compiler Design
Jan 31, 2019
by
Nandkishor3939
294
views
answer
comment
Follow
share this
share
2 Comments
by
newdreamz a1-z0
commented
Jan 31, 2019
reply
Follow
share this
CLR(1)
0
0
by
prashant jha 1
commented
Jan 31, 2019
reply
Follow
share this
CLR(1) is commonly known as LR(1) parser.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
aditi19
asked
in
Compiler Design
Mar 25, 2019
1,127
views
Compiler Design LR(1) doubt
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A->AB | a B->*AC | Cb | ∈ C->+ABc | ∈
aditi19
asked
in
Compiler Design
Mar 25, 2019
by
aditi19
1.1k
views
compiler-design
lr-parser
parsing
0
votes
0
votes
1
answer
2
aditi19
asked
in
Compiler Design
Sep 11, 2018
280
views
LR(k) grammar doubt
Do every LR(1) grammar have DPDA?
aditi19
asked
in
Compiler Design
Sep 11, 2018
by
aditi19
280
views
compiler-design
parsing
lr-parser
0
votes
0
votes
1
answer
3
abc1
asked
in
Compiler Design
Jan 26, 2019
3,994
views
how to check grammar is lr(1)?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals. Does LR(1) can parse all strings that are generated by grammar G.? Please any one help me to how to check it?
abc1
asked
in
Compiler Design
Jan 26, 2019
by
abc1
4.0k
views
compiler-design
grammar
parsing
lr-parser
1
vote
1
vote
1
answer
4
vaibhav101
asked
in
Compiler Design
Jan 13, 2018
665
views
Compiler Design - Parsing: Is LALR(1) made from the LR(0) or the LR(1) automaton?
According to my understanding, we LALR is constructed by reducing LR(1) automaton states. So I think it should be LR(1) However, we construct SLR(1) items from the LR(0) automaton, and we say with surety that number of states in SLR(...) is equal to number of states in LALR(...), how can this be?
vaibhav101
asked
in
Compiler Design
Jan 13, 2018
by
vaibhav101
665
views
compiler-design
lr-parser
parsing
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
