Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged left-recursion
0
votes
1
answer
1
COMPILER design
Is S->aS left recursive grammer?
Mudit Jain
asked
in
Compiler Design
Dec 27, 2022
by
Mudit Jain
67
views
left-recursion
0
votes
3
answers
2
Compute FIRST and FOLLOW for the postfix grammar S → S S + | S S * | a (Remove left recusrion and find out first and follow)
jayanth
asked
in
Compiler Design
Jun 16, 2022
by
jayanth
535
views
compiler-design
left-recursion
0
votes
0
answers
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
by
Sara Wageh
340
views
left-recursion
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
453
views
compiler-design
left-recursion
grammar
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$ ... SDT so the underlying grammar is not left recursive, and yet the same value of $B.val$ is computed for the entire input string.
Lakshman Patel RJIT
asked
in
Compiler Design
Sep 6, 2019
by
Lakshman Patel RJIT
1.2k
views
ullman
compiler-design
syntax-directed-translation
grammar
left-recursion
descriptive
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$
Lakshman Patel RJIT
asked
in
Compiler Design
Aug 20, 2019
by
Lakshman Patel RJIT
1.0k
views
ullman
compiler-design
grammar
left-recursion
descriptive
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 $
Lakshman Patel RJIT
asked
in
Compiler Design
Aug 20, 2019
by
Lakshman Patel RJIT
452
views
ullman
compiler-design
regular-expression
left-recursion
descriptive
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?
Lakshman Patel RJIT
asked
in
Compiler Design
Aug 20, 2019
by
Lakshman Patel RJIT
1.1k
views
ullman
compiler-design
regular-expression
left-recursion
descriptive
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
by
aditi19
868
views
compiler-design
syntax-directed-translation
left-recursion
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
216
views
compiler-design
parsing
left-recursion
ll-parser
descriptive
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.1k
views
ace-test-series
compiler-design
context-free-grammar
parsing
left-recursion
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
398
views
applied-course-2019-mock1
compiler-design
context-free-grammar
left-recursion
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 correct left- ...
Lakshman Patel RJIT
asked
in
Compiler Design
Jan 5, 2019
by
Lakshman Patel RJIT
213
views
uppcl2018
compiler-design
context-free-grammar
left-recursion
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
by
susgir2
644
views
compiler-design
left-recursion
grammar
parsing
recurrence-relation
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
by
aditi19
230
views
compiler-design
left-recursion
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
277
views
compiler-design
left-recursion
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.1k
views
compiler-design
left-recursion
ace-test-series
0
votes
5
answers
18
Compiler desigb
consider the following grammar E->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
553
views
compiler-design
grammar
left-recursion
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.4k
views
compiler-design
grammar
parsing
ll-parser
left-recursion
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
by
Mk Utkarsh
943
views
left-recursion
compiler-design
3
votes
4
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 derive ... "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
by
nishitshah
978
views
compiler-design
left-recursion
made-easy-test-series
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 unambiguos.........but shouldnt it be ambiguos because it has left recursion ?
A_i_$_h
asked
in
Compiler Design
Dec 23, 2017
by
A_i_$_h
339
views
compiler-design
ambiguous-grammar
left-recursion
descriptive
1
vote
1
answer
23
Made easy test series
Shivi rao
asked
in
Compiler Design
Oct 31, 2017
by
Shivi rao
260
views
compiler-design
context-free-grammar
parsing
left-recursion
made-easy-test-series
2
votes
2
answers
24
eliminate left recurrsion
Eliminate left recurrsion from S->S0S1S | 01
A_i_$_h
asked
in
Compiler Design
Oct 21, 2017
by
A_i_$_h
424
views
compiler-design
parsing
left-recursion
1
vote
2
answers
25
left recursion
Parshu gate
asked
in
Theory of Computation
Sep 17, 2017
by
Parshu gate
1.0k
views
compiler-design
left-recursion
grammar
recurrence-relation
parsing
0
votes
1
answer
26
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...with a ... > 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
by
A_i_$_h
204
views
compiler-design
parsing
left-recursion
descriptive
2
votes
0
answers
27
SELF DOUBT
Can we find FIRST and FOLLOW for a left recursive grammar?
Vivek Jain
asked
in
Compiler Design
Aug 19, 2017
by
Vivek Jain
626
views
compiler-design
left-recursion
first-and-follow
0
votes
1
answer
28
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.0k
views
compiler-design
grammar
parsing
left-recursion
ace-booklet
1
vote
1
answer
29
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
149
views
compiler-design
ambiguous-grammar
left-recursion
descriptive
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
IIIT-Delhi MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged left-recursion
Recent Blog Comments
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...
Was there interview for mtech as well?
Check CCMT website for previous year cutoff for...