GATE CSE 2001 | Question: 1.18

If a grammar has more than one leftmost derivation for a single sentential form, the grammar is ambiguous.
If a grammar has more than one rightmost derivation for a single sentential form, the grammar is ambiguous.
The leftmost and rightmost derivations for a sentential form may differ, even in an unambiguous grammar

8 votes

register_user_19

commented Oct 7, 2018

link is change-

https://www.eecis.udel.edu/~cavazos/cisc471-672-spring2018/lectures/Lecture-09.pdf

you can find all the above 3 point in page no 12

1 votes

Please log in or register to add a comment.

0 votes

For option D

An ambiguous grammar can never be LR(k) for any k, because LR(k) algorithm aren’t designed to handle ambiguous grammars. It would get stuck into undecidability problem, if employed upon an ambiguous grammar, no matter how large the constant k is.

Shailendra_ answered Dec 5, 2020

Shailendra_

See all

0 Please log in or register to add a comment.

Page:

« prev
1
2

Voting & Accepting an answer helps improve the community

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

20 votes

2 answers

Kathleen asked Sep 14, 2014

3,663 views

GATE CSE 2001 | Question: 18
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$ Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid ∊$ Construct all possible parse trees for the string abab. Is the grammar ambiguous?

Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid �...

Kathleen

3.7k views

Kathleen asked Sep 14, 2014

Compiler Design
gatecse-2001
compiler-design
grammar
descriptive

+ –

8 votes

1 answer

Kathleen asked Sep 14, 2014

2,076 views

GATE CSE 2001 | Question: 17
The syntax of the repeat-until statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The non-terminals $S$ and $S_1$ have an ... Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.

The syntax of the repeat-until statement is given by the following grammar$S \rightarrow\text{ repeat }S_1\text{ until }E$where E stands for expressions, $S$ and $S_1$ st...

Kathleen

2.1k views

Kathleen asked Sep 14, 2014

Compiler Design
gatecse-2001
compiler-design
syntax-directed-translation
normal
descriptive

+ –

23 votes

2 answers

Kathleen asked Sep 14, 2014

4,839 views

GATE CSE 2001 | Question: 16
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are: $ E \rightarrow aA$ $ E \rightarrow (E)$ $A \rightarrow +E$ $A \rightarrow *E$ $A \rightarrow \epsilon $ Compute the FIRST and FOLLOW sets for $E$ and $A$. Complete the LL(1) parse table for the grammar.

Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are:$ E \rightarrow aA$$ E \right...

Kathleen

4.8k views

Kathleen asked Sep 14, 2014

Compiler Design
gatecse-2001
compiler-design
parsing
normal
descriptive

+ –

62 votes

3 answers

Kathleen asked Sep 14, 2014

24,295 views

GATE CSE 2001 | Question: 2.18
Consider the following three C functions: $[P1]$ int *g(void) { int x = 10; return (&x); } $[P2]$ int *g(void) { int *px; *px = 10; return px; } $[P3]$ int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; ... of the above three functions are likely to cause problems with pointers? Only $P3$ Only $P1$ and $P3$ Only $P1$ and $P2$ $P1, P2$ and $P3$

Consider the following three C functions:$[P1]$ int *g(void) { int x = 10; return (&x); }$[P2]$ int *g(void) { int *px; *px = 10; return px; }$[P3]$ int *g(void) { int *p...

Kathleen

24.3k views

Kathleen asked Sep 14, 2014

Programming in C
gatecse-2001
programming
programming-in-c
normal
pointers

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

6 Answers

2 2 Comments reply

Please log in or register to add a comment.

0 reply

Please log in or register to add a comment.

Related questions

0

2 2 Comments

0