Recent questions tagged ambiguous

+1 vote

0 answers

1

Self Doubt : Ambiguity
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?

asked May 10 in Theory of Computation by logan1x (359 points) | 81 views

0 votes

0 answers

2

Michael Sipser Edition 3 Exercise 2 Question 9 (Page No. 155)
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why or why not$?$

asked May 1 in Theory of Computation by Lakshman Patel RJIT Boss (39.7k points) | 6 views

0 votes

0 answers

3

Peter Linz Edition 4 Exercise 5.2 Question 19 (Page No. 145)
Prove the following result. Let $G = (V, T, S, P )$ be a context-free grammar in which every $A ∈ V$ occurs on the left side of at most one production. Then $G$ is unambiguous.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 12 views

0 votes

0 answers

4

Peter Linz Edition 4 Exercise 5.2 Question 18 (Page No. 145)
Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$? Show that the grammar with productions $S\rightarrow aAb|\lambda,$ $A\rightarrow aAb|\lambda$ is unambiguous.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 16 views

0 votes

0 answers

5

Peter Linz Edition 4 Exercise 5.2 Question 16 (Page No. 145)
Show that the grammar with productions $S\rightarrow aAB,$ $A\rightarrow bBb,$ $B\rightarrow A|\lambda.$ is unambiguous.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 19 views

0 votes

0 answers

6

Peter Linz Edition 4 Exercise 5.2 Question 15 (Page No. 145)
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 27 views

0 votes

0 answers

7

Peter Linz Edition 4 Exercise 5.2 Question 14 (Page No. 145)
Show that the grammar $S\rightarrow aSb|SS|\lambda$ is ambiguous, but that the language denoted by it is not.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 15 views

0 votes

0 answers

8

Peter Linz Edition 4 Exercise 5.2 Question 13 (Page No. 145)
Show that the following grammar is ambiguous. $S\rightarrow aSbS|bSaS|\lambda$

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 11 views

0 votes

0 answers

9

Peter Linz Edition 4 Exercise 5.2 Question 11 (Page No. 145)
Is it possible for a regular grammar to be ambiguous?

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 13 views

0 votes

0 answers

10

Peter Linz Edition 4 Exercise 5.2 Question 7 (Page No. 145)
Construct an unambiguous grammar equivalent to the grammar in Exercise 6.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 16 views

0 votes

0 answers

11

Peter Linz Edition 4 Exercise 5.2 Question 6 (Page No. 145)
Show that the following grammar is ambiguous. $S\rightarrow AB|aaB,$ $A\rightarrow a|Aa,$ $B\rightarrow b.$

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 13 views

0 votes

0 answers

12

Peter Linz Edition 4 Exercise 5.2 Question 4 (Page No. 145)
Show that every s-grammar is unambiguous.

asked Apr 14 in Theory of Computation by Naveen Kumar 3 Boss (14k points) | 8 views

0 votes

0 answers

13

DFA NFA and ambiguity
Why is Regular grammar obtained from DFA always unambiguous? Why Regular grammar obtained from NFA may or may not be ambiguous?

asked Dec 7, 2018 in Theory of Computation by OneZero Active (2.1k points) | 43 views

0 votes

1 answer

14

Doubt in Grammar
Consider the following grammar which of the following is/are ambiguous? (i) S → y | SxS (ii) S → E | ExS and E → y (iii) S → Sxy | y

asked Sep 11, 2018 in Theory of Computation by goluabhinan (55 points) | 48 views

0 votes

0 answers

15

UGC NET DEC 2017 PAPER 2 Q 34-
Which of the following statements is/are TRUE ? (i) The grammar S → SS | a is ambiguous (where S is the start symbol). (ii) The grammar S → 0S1 | 01S | e is ambiguous (the special symbol e represents the empty string and S is the start symbol). (iii) The grammar ... TRUE (D) All of (i), (ii) and (iii) are TRUE Sure shot (i) and (ii) are true i want third one in brief

asked Jun 19, 2018 in Compiler Design by Nikhil Patil (489 points) | 255 views

0 votes

0 answers

16

Compiler design
Hi mates, Show that it is ambiguous grammar TIA S->aAB/bBA A->bS/a B->aS/b

asked Nov 24, 2017 in Compiler Design by Sahil1994 Junior (903 points) | 74 views

+1 vote

1 answer

17

UGCNET-Nov2017-ii-34
Which of the following statements is/are TRUE ? (a) The grammar $S \rightarrow SS\ |\ a$ is ambiguous. (Where $S$ is the start symbol) (b) The grammar $S \rightarrow 0S1\ |\ 01S\ |\ \epsilon$ is ambiguous. (The special symbol $\epsilon$ represents the empty string) (Where $S$ is the ... and (c) are TRUE. $(3)$ Only (b) and (c) are TRUE. $(4)$ All of (a), (b) and (c) are TRUE.

asked Nov 5, 2017 in Theory of Computation by Arjun Veteran (406k points) | 981 views

+2 votes

1 answer

18

REGULAR OR NOT
As given that 1st is not regular and 2nd is regular as 1st not form AP but 2nd form.but if in 2nd we fix value of m and n same then it will work as 1st(not regular) so 2nd also should not be regular.as i know if we fix m or n value as any constant it will be AP but what if same???

asked Aug 8, 2017 in Theory of Computation by learner_geek Active (3.1k points) | 244 views

+2 votes

1 answer

19

REGULAR OR NOT
Please mention reason with answer:-

asked Aug 8, 2017 in Theory of Computation by learner_geek Active (3.1k points) | 87 views

0 votes

1 answer

20

TestBook TestSeries
Consider the following statements : i) An ambiguous grammar can not generate DCFL. ii) An unambiguous grammar will always generate deterministic context free language. iii) Any non-empty language admits an ambiguous grammar. iv) All regular grammars are unambiguous. Which of the above is/are TRUE? i) and iv) only ii) and iii) only iii) only ii) and iv) only

asked Jan 29, 2017 in Theory of Computation by vnc Active (2.8k points) | 78 views

0 votes

0 answers

21

Self Doubt
By seeing a grammar I can say it is ambiguous or not. But How can I say it is inherently ambiguous or not.?

asked Jan 22, 2017 in Theory of Computation by Lucky sunda Active (4.4k points) | 132 views

0 votes

0 answers

22

Grammar ambiguity and parsing
$\begin{align*} \text {stmt} &\rightarrow \text{if expr then stmt else stmt} \\ & \;\; \;\; | \text{ if expr then stmt} \\ & \;\; \;\; | \text{ other} \end{align*}$ Which of the following statement/s is ... and the ambiguity cannot be resolved. B. The grammar is unambiguous C. The grammar is ambiguous and the ambiguity can be resolved D. None of these

asked Dec 15, 2016 in Compiler Design by dd Veteran (56.5k points) | 228 views

+6 votes

3 answers

23

Dangling Else Problem and Ambiguity Elimination
For the grammar given below $\textbf{stmt} \to$ $ \textbf{if} $expr$ \textbf{then}$ stmt $\mid $ $\textbf{if}$ expr $ \textbf{then}$ stmt$ \textbf{else}$ stmt $\mid \textbf{other} $ Which of the following ... and the ambiguity cannot be resolved. 3.The grammar is unambiguous. If we try to remove nondeterminism , will ambiguity always be removed?

asked Nov 21, 2016 in Compiler Design by vaishali jhalani Active (4.6k points) | 2k views

+14 votes

1 answer

24

GATE1987-1-xii
A context-free grammar is ambiguous if: The grammar contains useless non-terminals. It produces more than one parse tree for some sentence. Some production has two non terminals side by side on the right-hand side. None of the above.

asked Nov 8, 2016 in Theory of Computation by makhdoom ghaya Boss (29.3k points) | 860 views

+2 votes

3 answers

25

Theory-of-computation
S-> S+S | S*S | a | € Which is false? a) G is ambiguous b) L is ambiguous c) both a and b d) none

asked Nov 8, 2016 in Theory of Computation by Chetnawadhwa (451 points) | 271 views

+1 vote

2 answers

26

ambiguous grammar
Consider the following context-free grammar S → SS + | SS*| a for the string aa + a*. Is the grammar ambiguous ?

asked Nov 3, 2016 in Compiler Design by Shashank Chandekar Junior (533 points) | 809 views

+1 vote

2 answers

27

Ambiguous grammar
Is the given grammar ambiguous? S->AB A->a B->b

asked Oct 27, 2016 in Compiler Design by Prateek Arora Junior (555 points) | 288 views

+2 votes

2 answers

28

How to determine whether the grammar is regular or not?
If any grammer is given, how can we tell that the grammar is regular or not? Is that any perticular method?

asked Sep 21, 2016 in Theory of Computation by Kaushal28 (17 points) | 764 views

+1 vote

1 answer

29

Parse trees
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse trees concluding it as ambiguous.. Only with reference to the string 'b' otherwise i know its ambiguous...

asked Jul 22, 2016 in Theory of Computation by Chetnawadhwa (451 points) | 420 views

+3 votes

3 answers

30

ambiguous grammar
An ambiguous grammar is one that produces more than one left most derivation for the same sentence. more than one right most derivation for the same sentence. more than one leftmost derivation for the different sentence. i and ii i or ii ii and iii ii or iii

asked Jun 24, 2016 by vivekpinto07 (223 points) | 1.4k views

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 questions tagged ambiguous

Recent Posts

Recent Blog Comments