Dark Mode

Recent questions tagged left-recursion

0 votes

2 answers

1

COMPILER design
Is S->aS left recursive grammer?

Mudit Jain asked in Compiler Design Dec 27, 2022

370 views

0 votes

3 answers

2

Remove left recusrion and find out first and follow
Compute the FIRST and FOLLOW for the postfix grammar after removing the left recursion: $ S → S S+/ S S* /a$

jayanth asked in Compiler Design Jun 16, 2022

3.3k views

0 votes

1 answer

3

To get follow of grammar ,Should I remove left_recursion first?
S-> SS | Aa A->Sb | a (a) prove that the grammar is ambiguous. (b) find the follow for the grammar (c) then remove the left recursion from the grammar.

Sara Wageh asked in Compiler Design Dec 31, 2021

1.1k views

4 votes

1 answer

4

S->AA/ab A->Bd/null B->SB/d remove left recursion
S->AA/ab A->Bd/null B->SB/d remove left recursion

vrajdobariya asked in Compiler Design Sep 6, 2021

by vrajdobariya

1.1k views

1 vote

1 answer

5

Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 3 (Page No. 337)
The following SDT computes the value of a string of $0's$ and $1's$ ... so the underlying grammar is not left recursive, and yet the same value of $B.val$ is computed for the entire input string.

admin asked in Compiler Design Sep 6, 2019

by admin

2.1k views

1 vote

0 answers

6

Ullman (Compiler Design) Edition 2 Exercise 4.4 Question 1 (Page No. 231)
For each of the following grammars, devise predictive parsers and show the parsing tables. You may left-factor and/or eliminate left-recursion from your grammars first. $S\rightarrow 0S1\mid 01$ ... $bfactor\:\rightarrow\:not\:bfactor\mid (bexpr)\mid true\mid false$

admin asked in Compiler Design Aug 20, 2019

by admin

1.3k views

0 votes

0 answers

7

Ullman (Compiler Design) Edition 2 Exercise 4.3 Question 2 (Page No. 216 - 217)
Repeat Exercise 4.3.1 on the following grammars: $S\rightarrow SS+\mid SS\: \ast\mid a$ $S\rightarrow 0S1\mid 01$ $S\rightarrow S ( S ) S\mid \epsilon$ $S\rightarrow (L)\mid a$ ... $bterm\rightarrow bterm\:and\:bfactor\mid bfactor$ $bfactor\rightarrow not\: bfactor\mid ( bexpr )\mid true \mid false $

admin asked in Compiler Design Aug 20, 2019

by admin

639 views

0 votes

0 answers

8

Ullman (Compiler Design) Edition 2 Exercise 4.3 Question 1 (Page No. 216)
The following is a grammar for regular expressions over symbols $a$ and $b$ only, using $+$ in place of $\mid$ for union, to avoid conflict with the use of vertical bar as a metasymbol in ... to left factoring, eliminate left recursion from the original grammar. Is the resulting grammar suitable for top-down parsing?

admin asked in Compiler Design Aug 20, 2019

by admin

1.5k views

0 votes

0 answers

9

Ullman(2e) Exercise-5.4.2 page no-336 Syntax Directed Translation
Rewrite the following SDT: A->A {a} B | AB {b} | 0 B->B {c} A | BA {d} | 1 so that the underlying grammar becomes non-left-recursive. Here a, b, c and d are actions, and 0 and 1 are terminals is my solution correct? A→ 0A’ A’→ {a} BA’ | B {b} A’ | ε B→ 1B’ B’→ {c} AB’ | A {d} B’ | ε

aditi19 asked in Compiler Design Mar 29, 2019

1.2k views

0 votes

1 answer

10

Self doubt
We know that a grammar is contain 1-left recursive 2-ambiguous 3-Common prefix Then grammar is not LL(1) If let I constructed M-TABLE or PARSE TABLE of grammar which is not contain left recursive and common prefixes . Let consider I am not able to find out ... not , If LL(1) parse table contains multiple choice in same row and column then Can I said that grammar is ambiguous or not?

Ashish RajAnand asked in Compiler Design Feb 5, 2019

by Ashish RajAnand

427 views

0 votes

1 answer

11

Ace Test Series: Compiler Design - Left Recursion Elimination

Shankar Kakde asked in Compiler Design Jan 23, 2019

by Shankar Kakde

1.6k views

1 vote

1 answer

12

Applied Course | Mock GATE | Test 1 | Question: 60
The left-factoring of the given CFG is $S \rightarrow aBcD \mid aBD \mid daB \mid d$ $B \rightarrow b$ $D \rightarrow d$ $S \rightarrow aBB' \mid d$ $B' \rightarrow cD \mid D$ $B \rightarrow b$ $D \rightarrow d$ ... $B' \rightarrow aB$ $B \rightarrow b$ $D \rightarrow d$ None of them

Applied Course asked in Compiler Design Jan 16, 2019

by Applied Course

615 views

0 votes

1 answer

13

UPPCL AE 2018:64
The following grammar $\text{G}$ is left recursive. $\text{E} \rightarrow \text{E + T}\; \mid \; \text{T} $ $\text{T} \rightarrow \text{T * F} \; \mid \; \text{F} $ $\text{F} \rightarrow \text{(E)} \mid \textbf{id} $ Which of the following is a ...

admin asked in Compiler Design Jan 5, 2019

by admin

354 views

1 vote

1 answer

14

Non-Left recursive grammar of the below grammar.
Grammar. S → Aa | B A → Ac | Aad | bd | epsilon . .

susgir2 asked in Compiler Design Jan 2, 2019

923 views

0 votes

0 answers

15

https://gateoverflow.in/1697/gate1998-6b
why isn't A replaced in the first production? that is also indirect recursive

aditi19 asked in Compiler Design Oct 26, 2018

392 views

0 votes

0 answers

16

Left Recursion
Remove the Left Recursion from it : A -> B|a|CBD B -> C|b C -> A|c D -> d

Na462 asked in Compiler Design Sep 19, 2018

by Na462

399 views

2 votes

2 answers

17

Left recursion
In this question should we eliminate left recursion by putting values of S and A in the respective productions so answer will be c but if according to the given production than answer will be a how to solve?

saumya mishra asked in Compiler Design Jun 11, 2018

by saumya mishra

1.7k views

0 votes

5 answers

18

Compiler desigb
consider the following grammar $E\rightarrow int|int+E|int-E |int-(E) |int*E$ Which statement is true? a) Grammer is left factored b) Cant be determined

Pun M asked in Compiler Design Apr 1, 2018

by Pun M

881 views

0 votes

1 answer

19

Check if grammar is LL(1) ?
Given a grammar : $E \rightarrow E + T / T$ $T \rightarrow i$ Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ?

Rahul Ranjan 1 asked in Compiler Design Mar 19, 2018

by Rahul Ranjan 1

4.9k views

0 votes

1 answer

20

Left Recursion Removal
Remove Left Recursion from the following Context Free Grammar. $S \rightarrow Aa| Sa|c$ $A \rightarrow Ab|Sd|e$

Mk Utkarsh asked in Compiler Design Jan 31, 2018

1.2k views

3 votes

5 answers

21

MadeEasy Test Series 2018: Compiler Design - Left Recursion
I think the answer should be option: C but it is given option A. Providing the snapshot of the question with the options provided. I don't think option A should be the correct one, even if it then we cannot ... "bda" from option A which is possible in the original grammar. Please help with this question. Thanks in advance.

nishitshah asked in Compiler Design Jan 23, 2018

1.6k views

0 votes

1 answer

22

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?

A_i_$_h asked in Compiler Design Dec 23, 2017

612 views

2 votes

2 answers

23

eliminate left recurrsion
Eliminate left recurrsion from $S\rightarrow S0S1S | 01$

A_i_$_h asked in Compiler Design Oct 20, 2017

873 views

1 vote

2 answers

24

Parshu gate asked in Theory of Computation Sep 17, 2017

1.2k views

0 votes

1 answer

25

LEft recurssion
E -> E+T / T T -> id grammar after left recursion is a) E->T +E / T T ->id b)E ->T / E + T T ->id c) E->E' T T->+TE' / epsilon d)E ->TX X- > +TX / epsilon Actually it should be option c... ... T E'..the position of E and T is interchanged.in the option..........is that a pproblem??? the answer is given as option D can someone please help

A_i_$_h asked in Compiler Design Sep 7, 2017

334 views

2 votes

0 answers

26

SELF DOUBT
Can we find FIRST and FOLLOW for a left recursive grammar?

Vivek Jain asked in Compiler Design Aug 19, 2017

771 views

0 votes

1 answer

27

LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do

learner_geek asked in Compiler Design Aug 5, 2017

by learner_geek

1.3k views

Page:

Recent questions tagged left-recursion