Register

Recent questions tagged ambiguous-grammar

1 votes
1 answer
2
NPTEL Assignment Question
Natural language constructs are (A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
Natural language constructs are(A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
User Avatar
0 votes
1 answer
5
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$.$
$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...
User Avatar
0 votes
1 answer
7
Context free grammars
Any left factored Context-Free Grammar is both unambiguous and non-left-recursive. True or false?
Any left factored Context-Free Grammar is both unambiguous and non-left-recursive. True or false?
User Avatar
1 votes
1 answer
8
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.?
S->ABA->aB->bthis 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.?
User Avatar
2 votes
3 answers
10
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 ?
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 deriv...
User Avatar
0 votes
5 answers
11
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$
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
User Avatar
0 votes
1 answer
12
Test Questiion
$G: S\rightarrow SbS\mid a$ Grammars are ambiguous True/False.
$G: S\rightarrow SbS\mid a$Grammars are ambiguous True/False.
User Avatar
0 votes
1 answer
13
ambiguity
$E→E−T ∣ T$ $T→T/F ∣ F$ $F→(E) ∣ id$ (E is the start symbol) This grammar is unambiguous but shouldn't it be ambiguous because it has left recursion?
$E→E−T ∣ T$$T→T/F ∣ F$$F→(E) ∣ id$(E is the start symbol)This grammar is unambiguous but shouldn't it be ambiguous because it has left recursion?
User Avatar
0 votes
2 answers
14
[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
The productionsE - E+E | E-E | E*E | ida:) generates inherently ambiguous languagesb:) generates and ambiguous languagec:) is an ambiguous grammerd) none of these
User Avatar
1 votes
1 answer
15
PARSER
Is this statement true:- If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.
Is this statement true:-If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.
User Avatar
2 votes
1 answer
16
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.
Is this grammar ambiguous?S >SxA|AA >AyB|BB >zB|(S)|m|nI cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.
User Avatar
2 votes
2 answers
17
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)
Ques. S Aa/bAc/dc A dWhich 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 Ambiguo...
User Avatar
2 votes
1 answer
18
Ambiguous to unambiguous
Make this grammer into unambiguous
Make this grammer into unambiguous
User Avatar
1 votes
1 answer
19
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???
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???
User Avatar
1 votes
1 answer
20
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
If i am wrong please let me correct with giving proper explanation.
User Avatar
1 votes
1 answer
21
COMPILER DESIGN
How to prove that every regular language is unambiguous?
How to prove that every regular language is unambiguous?
User Avatar
Page: