Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged lr-parser
0
votes
1
answer
91
TANCET 2016 PARSING
Balaji Jegan
260
views
Balaji Jegan
asked
Oct 23, 2018
Compiler Design
tancet
compiler-design
parsing
lr-parser
+
–
0
votes
1
answer
92
Compiler self doubt
Can we comment/compare the number of GOTO moves in LALR and CLR CLR and SLR?
Can we comment/compare the number of GOTO moves inLALR and CLRCLR and SLR?
manisha11
391
views
manisha11
asked
Oct 21, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
0
votes
1
answer
93
Self Doubt
What is actual difference between in LALR(1) and CLR(1). please explain this by taking one example.
What is actual difference between in LALR(1) and CLR(1).please explain this by taking one example.
iamdeepakji
293
views
iamdeepakji
asked
Oct 10, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
1
votes
5
answers
94
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
+
–
0
votes
0
answers
95
Doubt
Is LR(0) grammar can generate same languages as LR(1) grammar can generate?
Is LR(0) grammar can generate same languages as LR(1) grammar can generate?
soumayan bandhu
234
views
soumayan bandhu
asked
Sep 16, 2018
Compiler Design
compiler-design
lr-parser
+
–
0
votes
1
answer
96
LR(k) grammar doubt
Do every LR(1) grammar have DPDA?
Do every LR(1) grammar have DPDA?
aditi19
275
views
aditi19
asked
Sep 11, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
0
votes
1
answer
97
parser
Consider a Context Free Grammar G I - if G is not Suitable for Top Down Parser then it is also not suitable for LR parsers Family. II - if G is not Suitable for Top Down Parser then it may work for Operator Precedence parsers. III- .if G is suitable for LR parsers ... it will surely work for Top Down Parser a) I and II correct b) II and III correct. c) only II correct d) all are correct
Consider a Context Free Grammar GI - if G is not Suitable for Top Down Parser then it is also not suitable for LR parsers Family.II - if G is not Suitable for Top Dow...
Lone Wolf
259
views
Lone Wolf
asked
Aug 12, 2018
Compiler Design
compiler-design
context-free-grammar
parsing
lr-parser
+
–
0
votes
2
answers
98
Compiler design
Deepalitrapti
293
views
Deepalitrapti
asked
Jul 19, 2018
Compiler Design
compiler-design
parsing
lr-parser
ambiguous
ll-parser
test-series
+
–
0
votes
0
answers
99
Principles of Compiler Design 6.2
$E \rightarrow E + T \hspace{5px} | \hspace{5px} T$ $T \rightarrow TF \hspace{5px} | \hspace{5px} F $ $F \rightarrow F^{*} \hspace{5px} | \hspace{5px} (E) \hspace{5px} | \hspace{5px} a \hspace{5px} | \hspace{5px} b \hspace{5px} | \hspace{5px} \epsilon $ Construct the LALR sets of items and the parse table for the above grammar.
$E \rightarrow E + T \hspace{5px} | \hspace{5px} T$$T \rightarrow TF \hspace{5px} | \hspace{5px} F $$F \rightarrow F^{*} \hspace{5px} | \hspace{5px} (E) \hspace{5px} | \...
Mk Utkarsh
520
views
Mk Utkarsh
asked
Jun 29, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
0
votes
1
answer
100
compiler design
Shivani gaikawad
218
views
Shivani gaikawad
asked
Jun 3, 2018
Compiler Design
compiler-design
parsing
lr-parser
numerical-answers
test-series
+
–
0
votes
1
answer
101
compiler design
Shivani gaikawad
169
views
Shivani gaikawad
asked
May 31, 2018
Compiler Design
compiler-design
grammar
parsing
lr-parser
test-series
+
–
2
votes
1
answer
102
compiler
Prince Sindhiya
216
views
Prince Sindhiya
asked
May 31, 2018
Compiler Design
compiler-design
grammar
parsing
lr-parser
test-series
+
–
0
votes
1
answer
103
compiler design
Prince Sindhiya
272
views
Prince Sindhiya
asked
May 31, 2018
Compiler Design
compiler-design
grammar
parsing
lr-parser
test-series
+
–
0
votes
1
answer
104
Compiler design
Shivani gaikawad
424
views
Shivani gaikawad
asked
May 30, 2018
Compiler Design
compiler-design
lr-parser
test-series
+
–
2
votes
2
answers
105
Bottom up parsers
What is the difference between $SLR(1)$ and $LALR(1)$ parser ? Both parser have same parsing table then how $SLR$ is subset of $LALR$ ?
What is the difference between $SLR(1)$ and $LALR(1)$ parser ? Both parser have same parsing table then how $SLR$ is subset of $LALR$ ?
gate19
1.1k
views
gate19
asked
May 26, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
0
votes
2
answers
106
SELF DOUBT
it is confirmed that every LL(1) is LR(1) i.e CLR(1),but i want to know that is every LL(1) grammar is also LALR????? becz LALR is subset of CLR(1).
it is confirmed that every LL(1) is LR(1) i.e CLR(1),but i want to know that is every LL(1) grammar is also LALR????? becz LALR is subset of CLR(1).
eyeamgj
284
views
eyeamgj
asked
May 16, 2018
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
+
–
0
votes
1
answer
107
ugc net
Which of the following grammar is LR (1) ? (A) A --> a A b, A --> b A b, A --> a , A --> b (B) A --> a A a, A --> a A b, A --> c (C) A --> A + A, A --> a (D) Both (A) and (B)
Which of the following grammar is LR (1) ?(A) A a A b, A b A b, A a , A b(B) A a A a, A a A b, A c(C) A A + A, A a(D) Both (A) and (B)
shruti gupta1
397
views
shruti gupta1
asked
May 15, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
0
votes
1
answer
108
LR Parsers
#self_doubt While representing the canonical collection of LR(0) or LR(1) items why first augmented production is added in state diagram??
#self_doubtWhile representing the canonical collection of LR(0) or LR(1) items why first augmented production is added in state diagram??
Naveen Kumar 3
348
views
Naveen Kumar 3
asked
May 9, 2018
Compiler Design
lr-parser
+
–
0
votes
2
answers
109
Compiler design semester exam question
Can the following grammar be parsed by LR(0) parser? E -> E+id | id Is the accept state entry considered on all the terminal symbol columns for LR(0) parser?
Can the following grammar be parsed by LR(0) parser?E - E+id | idIs the accept state entry considered on all the terminal symbol columns for LR(0) parser?
Jayant Isswani
569
views
Jayant Isswani
asked
May 2, 2018
Compiler Design
compiler-design
lr-parser
parsing
+
–
1
votes
1
answer
110
compiler
E---->T+E T------>i a)LR(0) b)SLR c)LALR dnone
E >T+ET >ia)LR(0)b)SLRc)LALRdnone
satyam132
178
views
satyam132
asked
Apr 21, 2018
Compiler Design
compiler-design
grammar
parsing
lr-parser
+
–
1
votes
1
answer
111
LL(n)
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we are given that maximum length of non-determinism in a production is n - 1. Can we use this grammar for LL(n) predictive parsing?
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we a...
smsubham
1.0k
views
smsubham
asked
Apr 4, 2018
Compiler Design
compiler-design
ll-parser
parsing
lr-parser
grammar
+
–
0
votes
3
answers
112
LR(0) Parsing Table
Please anyone create a $LR(0)$ Parsing table on this grammar and show the working of each step: $S' \rightarrow S$ $S \rightarrow S$;$A \mid A$ $A \rightarrow E \mid id := E$ $E \rightarrow E+id \mid id$ Non-Terminals: $S'$ $S$ $A$ $E$ Terminals$: ; := + id$ Please take a screenshot of copy and show in the answer the whole working.
Please anyone create a $LR(0)$ Parsing table on this grammar and show the working of each step:$S' \rightarrow S$$S \rightarrow S$;$A \mid A$$A \rightarrow E \mid id := ...
rahuldb
3.3k
views
rahuldb
asked
Mar 17, 2018
Compiler Design
compiler-design
lr-parser
parsing
grammar
+
–
0
votes
1
answer
113
self doubt
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
shivanisrivarshini
551
views
shivanisrivarshini
asked
Mar 10, 2018
Compiler Design
compiler-design
parsing
ll-parser
lr-parser
descriptive
+
–
1
votes
1
answer
114
TEST_SERIES
ANSWER IS CORRECT BU I HAVE DOUBT IN A -> .Ab, a/b I think it must be A -> .Ab ,a
ANSWER IS CORRECT BU I HAVE DOUBT IN A - .Ab, a/bI think it must be A - .Ab ,a
mehul vaidya
291
views
mehul vaidya
asked
Mar 10, 2018
Compiler Design
compiler-design
parsing
lr-parser
ace-test-series
+
–
0
votes
1
answer
115
Virtual Gate Test Series: Compiler Design - Parsers
Consider the grammar given $S\rightarrow AA$ $A\rightarrow aA / b$ How many entries will be blank in the GOTO table for SR(0) items?
Consider the grammar given$S\rightarrow AA$$A\rightarrow aA / b$How many entries will be blank in the GOTO table for SR(0) items?
Utsav09
352
views
Utsav09
asked
Jan 31, 2018
Compiler Design
compiler-design
parsing
lr-parser
virtual-gate-test-series
+
–
0
votes
0
answers
116
made easy test series
Consider the following grammar G: S->AB|d A->aA|b B->bB|c The grammar G is A LL (1) grammar and not LR (0) B LL (1) and LR (0) C Not LL (1) but LR (0) /*correct answer*/ D Neither LL (1) nor LR (0)
Consider the following grammar G:S->AB|dA->aA|bB->bB|c The grammar G isA LL (1) grammar and not LR (0)B LL (1) and LR (0)C Not LL (1) but LR (0) /*correct answer*/D Neith...
rohit vishkarma
290
views
rohit vishkarma
asked
Jan 29, 2018
Compiler Design
ll-parser
lr-parser
+
–
1
votes
1
answer
117
Comparing Parsers
The power of parsers is as follows: CLR(1) > LALR(1) > SLR(1) > LR(0) > LL(1) Can we say that if a language is not parsed by powerful parser then less powerful parsers can't parse that language? Likewise, if a language ... parsed by all powerful parsers than that? Is there a formal proof for the above two questions? How to compare SLR and LALR parser formally?
The power of parsers is as follows:CLR(1) LALR(1) SLR(1) LR(0) LL(1)Can we say that if a language is not parsed by powerful parser then less powerful parsers can't pa...
Chiranjeevi Kanaka
3.1k
views
Chiranjeevi Kanaka
asked
Jan 25, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
3
votes
1
answer
118
Self Doubt
If shift-reduce conflicts occur in LALR(1) parsers(like yacc,etc).Who gets the higher precedence?shift or reduce?
If shift-reduce conflicts occur in LALR(1) parsers(like yacc,etc).Who gets the higher precedence?shift or reduce?
ankit_thawal
257
views
ankit_thawal
asked
Jan 22, 2018
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
2
votes
1
answer
119
ACE Grand Test 2 ( Compiler Design)
Consider the grammar : $S\rightarrow SS+ | SS* | a$ Which of the following is true: A) SLR(1) but not LL(1) B) LALR(1) but not SLR(1) C) LR(1) but not LALR(1) D) Neither LL(1) nor LR(1) I feel the grammar is ... . (Their key is suggesting the answer D saying it's ambiguous) Shouldn't A be the answer? Please guide me and correct me if I'm wrong
Consider the grammar :$S\rightarrow SS+ | SS* | a$Which of the following is true:A) SLR(1) but not LL(1)B) LALR(1) but not SLR(1)C) LR(1) but not LALR(1)D) Neither LL(1)...
Deepak Shinde
1.2k
views
Deepak Shinde
asked
Jan 20, 2018
Compiler Design
ace-test-series
compiler-design
parsing
lr-parser
+
–
4
votes
1
answer
120
self doubt
If a grammar is LL(1) then it would be definitely CLR(1) i.e. LR(1) or LALR(1)
If a grammar is LL(1) then it would be definitely CLR(1) i.e. LR(1) or LALR(1)
mohit kumar 5
818
views
mohit kumar 5
asked
Jan 18, 2018
Compiler Design
compiler-design
lr-parser
parsing
+
–
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register