The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged left-recursion
+1
vote
1
answer
1
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$ ... SDT so the underlying grammar is not left recursive, and yet the same value of $B.val$ is computed for the entire input string.
asked
Sep 6
in
Compiler Design
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
14
views
ullman
compiler-design
syntax-directed-translation
grammar
left-recursion
descriptive
0
votes
0
answers
2
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$
asked
Aug 20
in
Compiler Design
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
5
views
ullman
compiler-design
grammar
left-recursion
descriptive
0
votes
0
answers
3
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 $
asked
Aug 20
in
Compiler Design
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
22
views
ullman
compiler-design
regular-expressions
left-recursion
descriptive
0
votes
0
answers
4
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?
asked
Aug 20
in
Compiler Design
by
Lakshman Patel RJIT
Veteran
(
54.8k
points)
|
28
views
ullman
compiler-design
regular-expressions
left-recursion
descriptive
0
votes
0
answers
5
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’ | ε
asked
Mar 29
in
Compiler Design
by
aditi19
Active
(
5.1k
points)
|
72
views
compiler-design
syntax-directed-translation
left-recursion
+1
vote
1
answer
6
Ace Test Series: Compiler Design - Left Recursion Elimination
asked
Jan 23
in
Compiler Design
by
Shankar Kakde
(
195
points)
|
76
views
ace-test-series
compiler-design
cfg
left-recursion
+1
vote
0
answers
7
Non-Left recursive grammar of the below grammar.
Grammar. S → Aa | B A → Ac | Aad | bd | epsilon . .
asked
Jan 2
in
Compiler Design
by
susgir2
Active
(
1.5k
points)
|
80
views
compiler-design
left-recursion
grammar
parsing
recurrence
0
votes
0
answers
8
https://gateoverflow.in/1697/gate1998-6b
why isn't A replaced in the first production? that is also indirect recursive
asked
Oct 26, 2018
in
Compiler Design
by
aditi19
Active
(
5.1k
points)
|
76
views
compiler-design
left-recursion
0
votes
0
answers
9
Left Recursion
Remove the Left Recursion from it : A -> B|a|CBD B -> C|b C -> A|c D -> d
asked
Sep 19, 2018
in
Compiler Design
by
Na462
Loyal
(
6.9k
points)
|
54
views
compiler-design
left-recursion
0
votes
1
answer
10
Left Recursion Removal
Remove Left Recursion from the following Context Free Grammar. $S \rightarrow Aa| Sa|c$ $A \rightarrow Ab|Sd|e$
asked
Jan 31, 2018
in
Compiler Design
by
Mk Utkarsh
Boss
(
35.7k
points)
|
229
views
left-recursion
compiler-design
+3
votes
0
answers
11
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 derive ... "bda" from option A which is possible in the original grammar. Please help with this question. Thanks in advance.
asked
Jan 23, 2018
in
Compiler Design
by
nishitshah
(
187
points)
|
222
views
compiler-design
left-recursion
made-easy-test-series
+1
vote
2
answers
12
left recursion
asked
Sep 17, 2017
in
Theory of Computation
by
Parshu gate
Active
(
3.1k
points)
|
202
views
compiler-design
left-recursion
grammar
recurrence
parsing
+1
vote
0
answers
13
SELF DOUBT
Can we find FIRST and FOLLOW for a left recursive grammar?
asked
Aug 19, 2017
in
Compiler Design
by
Vivek Jain
Junior
(
781
points)
|
136
views
compiler-design
left-recursion
first
follow
+20
votes
6
answers
14
GATE2017-2-32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $F \rightarrow (E) \mid id$ $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$
asked
Feb 14, 2017
in
Compiler Design
by
Arjun
Veteran
(
425k
points)
|
3k
views
gate2017-2
grammar
left-recursion
+1
vote
1
answer
15
Remove Left recursion from context free grammer
asked
Jan 31, 2017
in
Compiler Design
by
rahuldb
(
275
points)
|
549
views
compiler-design
grammar
left-recursion
recurrence
+1
vote
2
answers
16
Remove Left recursion
Eliminate the left recursion of the grammar $S\rightarrow Bb / a$ $B\rightarrow Bc /Sd /e$
asked
Jan 7, 2017
in
Compiler Design
by
Anand.
Active
(
2.3k
points)
|
863
views
compiler-design
left-recursion
+1
vote
1
answer
17
Made Easy Test Series-2016
Ex. Consider the following grammar G. A → A + B|B B → int|(A) Which of the following grammar is equivalent to the above grammar G? a. A -> int + B | B B -> int | (A) | epsilon b. A -> BA' A' -> BA' | epsilon B -> int | (+A) c. ... | (A) but the answer given is C so can anybody please tell me how A' -> (A + B)A' | epsilon becomes A' -> +BA' | epsilon ?
asked
Nov 29, 2016
in
Compiler Design
by
Anshul_S
(
11
points)
|
114
views
compiler-design
left-recursion
+2
votes
3
answers
18
Remove Left Recursion from given grammar, if any?
asked
Nov 14, 2016
in
Compiler Design
by
smartmeet
Active
(
4.9k
points)
|
808
views
compiler-design
parsing
grammar
left-recursion
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
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 Posts
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged left-recursion
Recent Blog Comments
Even In 2019 my 16 questions goes for negative...
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
50,647
questions
56,497
answers
195,489
comments
100,811
users