Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ll-parser
4
votes
0
answers
1
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 53
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?
GO Classes
850
views
GO Classes
asked
Feb 5
Compiler Design
goclasses2024-mockgate-14
numerical-answers
compiler-design
parsing
ll-parser
2-marks
+
–
5
votes
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 34
$ \begin{aligned} & S \rightarrow S1 \;T \\ & S 1 \rightarrow a \mid(S S) \\ & T \rightarrow \varepsilon \mid b \;T \end{aligned} $ In the $\text{LL(1)}$ parser table, $M$ ... $\{T \rightarrow \varepsilon\}$ $\{S 1 \rightarrow a\}$ and $\{T \rightarrow \varepsilon\}$
$$\begin{aligned}& S \rightarrow S1 \;T \\& S 1 \rightarrow a \mid(S S) \\& T \rightarrow \varepsilon \mid b \;T\end{aligned}$$In the $\text{LL(1)}$ parser table, $M$, of...
GO Classes
400
views
GO Classes
asked
Jan 21
Compiler Design
goclasses2024-mockgate-12
goclasses
compiler-design
parsing
ll-parser
2-marks
+
–
0
votes
1
answer
3
Which of the following is LL(1) grammar?
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$ B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow \varepsilon $ C) $E\rightarrow E+E\mid (E) \mid id$
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow...
rexritz
598
views
rexritz
asked
Oct 22, 2023
Compiler Design
compiler-design
ll-parser
+
–
0
votes
1
answer
4
self doubt compiler desgine
we know that LL(1)$\subseteq$ LR(1) LL(2)$\subseteq$ LR(2) LL(3)$\subseteq$ LR3) LL(4)$\subseteq$ LR(4)…..ANd so on can we say that LL(1)$\subseteq$ LR(2) or LL(2)$\subseteq$ LR(1). 1,2 are the lookahead .
we know that LL(1)$\subseteq$ LR(1) LL(2)$\subseteq$ LR(2) LL(3)$\subseteq$ LR3) LL(4)$\subseteq$...
jugnu1337
178
views
jugnu1337
asked
Aug 13, 2023
Compiler Design
ll-parser
+
–
0
votes
1
answer
5
Compiler Design self Doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)" What is meaning of this statement exactly and does it hold always? My Assumptions: If a grammar is right linear grammar then it can be parser by LL(1) ->I ... right linear grammar. But this is not suffice to make grammar LL(1). Correct if I assumed anything wrong with some intutive answer.
"Every Regular Grammar has a Right linear grammar and this is LL(1)"What is meaning of this statement exactly and does it hold always?My Assumptions:If a grammar is right...
vishnu777
340
views
vishnu777
asked
Nov 25, 2022
Compiler Design
compiler-design
ll-parser
parsing
+
–
1
votes
1
answer
6
Test series Made easy
How to solve this ? Please help.
How to solve this ? Please help.
raja11sep
630
views
raja11sep
asked
Dec 31, 2021
Compiler Design
compiler-design
grammar
context-free-grammar
ll-parser
descriptive
made-easy-test-series
+
–
0
votes
1
answer
7
#self doubt
What is the difference between recursive descent parser and ll(1) parser, since in both no left recursion and left factoring is allowed…..then what is the advantage of using recursive descent parser??
What is the difference between recursive descent parser and ll(1) parser, since in both no left recursion and left factoring is allowed…..then what is the advantage of ...
samarpita
266
views
samarpita
asked
Nov 18, 2021
Compiler Design
compiler-design
ll-parser
+
–
0
votes
0
answers
8
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 6 (Page No. 258)
Show that the following grammar: $S\rightarrow SA\mid A$ $A\rightarrow a$ is SLR(1) but not LL(1).
Show that the following grammar:$S\rightarrow SA\mid A$$A\rightarrow a$is SLR(1) but not LL(1).
admin
455
views
admin
asked
Aug 20, 2019
Compiler Design
ullman
compiler-design
grammar
parsing
ll-parser
descriptive
+
–
2
votes
0
answers
9
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 5 (Page No. 258)
Show that the following grammar: $S\rightarrow AaAb\mid BbBa$ $A\rightarrow \epsilon$ $A\rightarrow\epsilon$ is LL(1) but not SLR(1).
Show that the following grammar:$S\rightarrow AaAb\mid BbBa$$A\rightarrow \epsilon$$A\rightarrow\epsilon$is LL(1) but not SLR(1).
admin
365
views
admin
asked
Aug 20, 2019
Compiler Design
ullman
compiler-design
grammar
parsing
ll-parser
descriptive
+
–
2
votes
4
answers
10
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
S→ A/aA→ aLL1 or not?
Hirak
934
views
Hirak
asked
Jun 4, 2019
Compiler Design
compiler-design
ll-parser
syntax-directed-translation
+
–
0
votes
1
answer
11
Compiler design Self doubt
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.
Hirak
2.0k
views
Hirak
asked
Jun 1, 2019
Compiler Design
compiler-design
ll-parser
parsing
syntax-directed-translation
+
–
1
votes
1
answer
12
Self-Doubt-Compiler
$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$ This language does not have LL(k) parser while being deterministic context free.Why?
$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$This language does not have LL(k) parser while being deterministic context free.Why?
Ayush Upadhyaya
714
views
Ayush Upadhyaya
asked
Mar 3, 2019
Compiler Design
compiler-design
context-free-language
ll-parser
descriptive
+
–
0
votes
1
answer
13
Predictive parsing
Get LL(1) parsing table for the following grammar A--> aCDq / aBg C --> p /Ct / BD / rAB D--> d B-->e
Get LL(1) parsing table for the following grammarA aCDq / aBgC p /Ct / BD / rABD dB >e
Sagar Chintawar
1.8k
views
Sagar Chintawar
asked
Feb 11, 2019
Compiler Design
compiler-design
parsing
ll-parser
descriptive
+
–
0
votes
1
answer
14
Predictive
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or not S --> (L) / a L --> L, S / S
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or notS (L) / aL L, S / S
Sagar Chintawar
640
views
Sagar Chintawar
asked
Feb 11, 2019
Compiler Design
compiler-design
parsing
ll-parser
true-false
+
–
0
votes
1
answer
15
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?
We know that a grammar is contain1-left recursive2-ambiguous3-Common prefixThen grammar is not LL(1) If let I constructed M-TABLE or PARSE TABLEof grammar which is not co...
Ashish RajAnand
424
views
Ashish RajAnand
asked
Feb 5, 2019
Compiler Design
compiler-design
parsing
left-recursion
ll-parser
descriptive
+
–
2
votes
1
answer
16
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 7
Which of the following is a requirement for an LL(1) grammar? Unambiguity No left recursion If $A \to \alpha \mid \beta$ are two productions, then $FIRST(\alpha)$ and $FIRST(\beta)$ are disjoint (i) and (ii) (iii) (i), (ii) and (iii) (ii) and (iii)
Which of the following is a requirement for an LL(1) grammar?UnambiguityNo left recursionIf $A \to \alpha \mid \beta$ are two productions, then $FIRST(\alpha)$ and $FIRST...
Arjun
4.0k
views
Arjun
asked
Jan 26, 2019
Compiler Design
go-cd-1
ll-parser
+
–
2
votes
2
answers
17
UPPCL AE 2018:70
Consider the following grammar $\text{G:}$ $\text{P} \rightarrow \text{Q + R} \mid \text{Q - R} \mid \text{Q} \mid \text{R}$ $\text{Q} \rightarrow q \mid r$ $\text{R} \rightarrow r \mid s$ where $\text{P, Q,}$ and $\text{R}$ ... grammar $\text{G}$ Neither $\text{S1}$ nor $\text{S2}$ Only $\text{S1}$ Only $\text{S2}$ Both $\text{S1}$ and $\text{S2}$
Consider the following grammar $\text{G:}$$\text{P} \rightarrow \text{Q + R} \mid \text{Q – R} \mid \text{Q} \mid \text{R}$$\text{Q} \rightarrow q \mid r$$\text{R} \rig...
gate_forum
774
views
gate_forum
asked
Jan 13, 2019
Compiler Design
uppcl2018
compiler-design
parsing
ll-parser
+
–
1
votes
0
answers
18
MadeEasy Test Series: Compiler Design - Parsing
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this? According to me it is NOT LL(1) (since it is left factored), NOT LR(0) (Since the Item 0 has a R-R conflict), NOT SLR(1) (The item 0 has a RR conflict since Follow(X) = Follow(Y) = {a,b} correct me If i'm wrong
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this?According to me it is NOT LL(1) (since it is left factore...
Hopealways
1.3k
views
Hopealways
asked
Nov 23, 2018
Compiler Design
made-easy-test-series
compiler-design
parsing
ll-parser
+
–
0
votes
0
answers
19
LL grammar
LL grammar for the language: $L = \{a^mb^nC^{n+m} \mid m\geq 0, n\geq 0\}$ is a. S->aSc | S1 ; S1 -> bS1c | lambda b. none
LL grammar for the language:$L = \{a^mb^nC^{n+m} \mid m\geq 0, n\geq 0\}$ is a. S->aSc | S1 ; S1 - bS1c | lambdab. none
gate_forum
663
views
gate_forum
asked
Nov 17, 2018
Compiler Design
ll-parser
+
–
0
votes
1
answer
20
Parsing techniques
Consider the grammar S->a/ab/abc A) it is LL(1) B) it is LL(2) C) it is LL(3)
Consider the grammarS->a/ab/abcA) it is LL(1)B) it is LL(2)C) it is LL(3)
Prasanna Devi
347
views
Prasanna Devi
asked
Nov 17, 2018
Compiler Design
compiler-design
parsing
ll-parser
+
–
0
votes
0
answers
21
Self doubt
Show that no grammar that has cycles can be LL(1). Is it true ?? It is saying if the grammar has cycle it can't be LL(1) But what if the cycle in grammar is due to RIGHT RECURSiON which is allowed in LL(1) ???
Show that no grammar that has cycles can be LL(1).Is it true ??It is saying if the grammar has cycle it can't be LL(1)But what if the cycle in grammar is due to RIGHT REC...
jatin khachane 1
213
views
jatin khachane 1
asked
Nov 16, 2018
Compiler Design
compiler-design
ll-parser
+
–
2
votes
1
answer
22
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
sripo
3.2k
views
sripo
asked
Nov 10, 2018
Compiler Design
compiler-design
lr-parser
parsing
grammar
ll-parser
+
–
1
votes
1
answer
23
LL(1) Parsing
To compute FOLLOW(A) for any grammar symbol A a) We must compute FIRST of some grammar symbols. b) No need of computing FIRST of some symbols. c) Maybe compute FIRST of some symbols. d) None of the above. The answer is given as option (A) but if we take ... will definitely in FOLLOW(S) and we didn't computed FIRST of any symbol for it. So option (C) should be the answer.
To compute FOLLOW(A) for any grammar symbol A a) We must compute FIRST of some grammar symbols.b) No need of computing FIRST of some symbols.c) Maybe compute FIRST of som...
garvit_vijai
873
views
garvit_vijai
asked
Oct 10, 2018
Compiler Design
compiler-design
ll-parser
grammar
parsing
+
–
1
votes
5
answers
24
LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C
Every LL(1) grammar is ______A.SLR(1)B.LALR(1)C.LR(1)D.Both B & C
syncronizing
1.6k
views
syncronizing
asked
Sep 22, 2018
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register