Dark Mode

Recent questions tagged ambiguous-grammar

1 vote

1 answer

1

NPTEL Assignment Question
Natural language constructs are (A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options

rsansiya111 asked in Compiler Design Dec 6, 2021

392 views

3 votes

4 answers

2

ISRO2020-60
A given grammar is called ambiguous if two or more productions have the same non-terminal on the left hand side a derivation tree has more than one associated sentence there is a sentence with more than one derivation tree corresponding to it brackets are not present in the grammar

Satbir asked in Compiler Design Jan 13, 2020

by Satbir

7.7k views

0 votes

0 answers

3

Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 9 (Page No. 259)
The following is an ambiguous grammar: $S\rightarrow AS\mid b$ $A\rightarrow SA\mid a$ Construct for this grammar its collection of sets of $LR(0)$ items. If we try to build an LR-parsing table for ... choosing a possible action whenever there is a conflict. Show all the possible sequences of actions on input $abab$.

Lakshman Patel RJIT asked in Compiler Design Aug 20, 2019

by Lakshman Patel RJIT

317 views

0 votes

1 answer

4

Michael Sipser Edition 3 Exercise 2 Question 27 (Page No. 157)
$G$ is a natural-looking grammar for a fragment of a programming language, but $G$ is ambiguous$.$ Show that $G$ is ambiguous$.$ Give a new unambiguous grammar for the same language$.$

Lakshman Patel RJIT asked in Theory of Computation May 4, 2019

by Lakshman Patel RJIT

1.2k views

0 votes

1 answer

5

UPPCL AE 2018:11
Which of the following statements are $\text{FALSE}?$ Ambiguous grammars must have more than one parse tree for every string. Addition(+), subtraction(-), and assignment(=) operators in $\text{C}$ are left associative. Python is a weekly typed language. $1$ and $2$ $2$ and $3$ $1$ and $3$ $1, 2$ and $3$

Lakshman Patel RJIT asked in Compiler Design Jan 5, 2019

by Lakshman Patel RJIT

184 views

0 votes

1 answer

6

Context free grammars
Any left factored Context-Free Grammar is both unambiguous and non-left-recursive. True or false?

Iamniks4 asked in Compiler Design Dec 12, 2018

166 views

1 vote

1 answer

7

self doubt
S->AB A->a B->b this grammar is ambiguous or not. Q2; is it true that the number of left most derivation tree is always equal to number of right most derivation tree.?

eyeamgj asked in Compiler Design Nov 12, 2018

190 views

1 vote

1 answer

8

Is all ambiguous grammar could be converted to unambiguous?

Dhananjay15 asked in Compiler Design Aug 14, 2018

969 views

2 votes

3 answers

9

Ambiguous and unambiguous grammar
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ? Or we say a grammar is ambiguous only when it has more than one left most derivation ?

Rahul Ranjan 1 asked in Compiler Design May 28, 2018

by Rahul Ranjan 1

1.2k views

0 votes

5 answers

10

Finding Handles in a grammer
Total number of Handles for $(w=aa)$ in the following grammar ? $S\rightarrow DT$ $D\rightarrow aa$ $T\rightarrow \epsilon$

Abhishek Malik asked in Compiler Design Apr 5, 2018

by Abhishek Malik

725 views

0 votes

1 answer

11

Test Questiion
$G: S\rightarrow SbS\mid a$ Grammars are ambiguous True/False.

Nikhil Patil asked in Compiler Design Feb 8, 2018

by Nikhil Patil

227 views

0 votes

1 answer

12

ambiguity
E→E−T ∣ T T→T/F ∣ F F→(E) ∣ id (E is the start symbol) This grammar is unambiguos.........but shouldnt it be ambiguos because it has left recursion ?

A_i_$_h asked in Compiler Design Dec 23, 2017

325 views

0 votes

2 answers

13

[Compiler Design] Ambiguity
The productions E -> E+E | E-E | E*E | id a:) generates inherently ambiguous languages b:) generates and ambiguous language c:) is an ambiguous grammer d) none of these

rahul sharma 5 asked in Compiler Design Oct 17, 2017

by rahul sharma 5

7.9k views

1 vote

1 answer

14

PARSER
Is this statement true:- If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.

learner_geek asked in Compiler Design Aug 16, 2017

by learner_geek

2.8k views

2 votes

1 answer

15

Ullman 4.3
Is this grammar ambiguous? S-->SxA|A A-->AyB|B B-->zB|(S)|m|n I cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.

reena_kandari asked in Compiler Design Aug 15, 2017

by reena_kandari

239 views

2 votes

2 answers

16

Complier Design Test 1.1
Ques. S --> Aa/bAc/dc A --> d Which of them is correct. Please provide detailed information. a) LALR(1) but not SLR(1) b) Both SLR(1) and LALR(1) c) Grammar is Ambiguous d) Neither SLR(1) NOR LALR(1)

Shivam Bhardwaj asked in Compiler Design Aug 10, 2017

by Shivam Bhardwaj

546 views

2 votes

1 answer

17

Ambiguous to unambiguous
Make this grammer into unambiguous

learner_geek asked in Compiler Design Aug 5, 2017

by learner_geek

844 views

1 vote

1 answer

18

Basic grammer
A Grammar which is only left recursive or right recursive can be ambiguous grammar??? Or it should have both left recursive and right recursive to be ambiguous???

learner_geek asked in Compiler Design Aug 3, 2017

by learner_geek

136 views

1 vote

1 answer

19

Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.

learner_geek asked in Compiler Design Aug 3, 2017

by learner_geek

323 views

1 vote

1 answer

20

COMPILER DESIGN
How to prove that every regular language is unambiguous?

jatin kumar 3 asked in Compiler Design Jul 31, 2017

by jatin kumar 3

160 views

1 vote

1 answer

21

#testbook test series

shefali1 asked in Compiler Design Jul 24, 2017

627 views

0 votes

1 answer

22

Operator Precedence
E → E + E | E * E | ( E ) | id What will be operator precedence for above grammar.Is precedence differs due to ambiguity

jatin khachane 1 asked in Compiler Design Jun 7, 2017

by jatin khachane 1

310 views

0 votes

1 answer

23

Ankita Shingala asked in Compiler Design Jan 14, 2017

by Ankita Shingala

309 views

0 votes

1 answer

24

gate 2001
An unambiguous grammar has same leftmost and rightmost derivation Please provide an example to show this.

Adiaspirant asked in Compiler Design Jan 8, 2017

1.2k views

1 vote

4 answers

25

Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these

reena_kandari asked in Compiler Design Jan 5, 2017

by reena_kandari

384 views

Page:

Recent questions tagged ambiguous-grammar