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
Ambiguous or not
vishnu sharma (dreww
asked
in
Theory of Computation
Mar 30, 2018
retagged
Mar 30, 2018
by
Sukanya Das
213
views
1
vote
1
vote
$S\rightarrow Aa\mid Bb$
$A\rightarrow aA\mid bA\mid \epsilon$
$B\rightarrow bB\mid aB\mid \epsilon$
is ambiguous or not
theory-of-computation
vishnu sharma (dreww
asked
in
Theory of Computation
Mar 30, 2018
retagged
Mar 30, 2018
by
Sukanya Das
by
vishnu sharma (dreww
213
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
1
vote
1
vote
unambiguous
abhishekmehta4u
answered
Mar 30, 2018
by
abhishekmehta4u
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
3
votes
3
votes
0
answers
1
Aghori
asked
in
Theory of Computation
Oct 22, 2017
364
views
$L= { <G>$ is a CFG & not ambiguous $}$ RE or not?
$L= { <G>$ is a CFG & not ambiguous $}$ RE or not? We can have 2 TMs where $T_{yes}\subset T_{no}$ just by adding additional ambiguous productions to an existing non ambigous CFG. So it seems to me it is not RE, but given answer is RE. Where I am wrong?
Aghori
asked
in
Theory of Computation
Oct 22, 2017
by
Aghori
364
views
theory-of-computation
decidability
1
vote
1
vote
1
answer
2
learner_geek
asked
in
Compiler Design
Aug 2, 2017
551
views
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
learner_geek
asked
in
Compiler Design
Aug 2, 2017
by
learner_geek
551
views
compiler-design
parsing
ambiguous-grammar
true-false
4
votes
4
votes
1
answer
3
shekhar chauhan
asked
in
Compiler Design
Jun 2, 2016
1,225
views
Draw a Parse Tree and verify whether this grammar is Ambiguous or Not .
X--> X(Y) / Y Y--> (X)Y / 0 / 1 / Eps
shekhar chauhan
asked
in
Compiler Design
Jun 2, 2016
by
shekhar chauhan
1.2k
views
compiler-design
parsing
ambiguous
1
vote
1
vote
0
answers
4
tiger
asked
in
Theory of Computation
Dec 2, 2015
838
views
determine ambiguous or unambiguous
if any language is given , how we can determine that its grammar is ambiguous or unambiguous ex. L = {anbcm | n > 1, m ≤ n} its very big confusion for me . please explain in brief ?
tiger
asked
in
Theory of Computation
Dec 2, 2015
by
tiger
838
views
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
