Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Slides
Recent questions tagged parsing
0
votes
2
answers
241
compiler design
Prince Sindhiya
352
views
Prince Sindhiya
asked
May 23, 2018
Compiler Design
compiler-design
parsing
ll-parser
true-false
+
–
0
votes
2
answers
242
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
285
views
eyeamgj
asked
May 16, 2018
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
+
–
0
votes
1
answer
243
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
+
–
1
votes
1
answer
244
First And Follow
First and Follow set of the below grammar: S-> Aa / d A-> Bd / epsilon B-> Sc / epsilon
First and Follow set of the below grammar:S- Aa / dA- Bd / epsilonB- Sc / epsilon
dan31
1.7k
views
dan31
asked
May 5, 2018
Compiler Design
compiler-design
parsing
+
–
0
votes
2
answers
245
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
573
views
Jayant Isswani
asked
May 2, 2018
Compiler Design
compiler-design
lr-parser
parsing
+
–
1
votes
1
answer
246
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
+
–
2
votes
2
answers
247
First And Follow
Find First and Follow in the following grammar. $E\rightarrow E+T \mid T$ $T\rightarrow TF \mid F$ $F\rightarrow F^* \mid a \mid b$
Find First and Follow in the following grammar.$E\rightarrow E+T \mid T$$T\rightarrow TF \mid F$$F\rightarrow F^* \mid a \mid b$
Abhishek Malik
808
views
Abhishek Malik
asked
Apr 5, 2018
Compiler Design
compiler-design
grammar
parsing
first-and-follow
+
–
0
votes
0
answers
248
compiler
If we increase the number of lookahead in LL, LR, SLR,LALR, CLR grammar will its expressive power increase and what is the reason for that?
If we increase the number of lookahead in LL, LR, SLR,LALR, CLR grammar will its expressive power increase and what is the reason for that?
smsubham
488
views
smsubham
asked
Apr 4, 2018
Compiler Design
compiler-design
parsing
ll-parser
+
–
1
votes
1
answer
249
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
250
Compiler Design SDT
Is it Possible that any SDT can be L-attributed and S-attributed both in the same question?
Is it Possible that any SDT can be L-attributed and S-attributed both in the same question?
dixit bishwash
1.5k
views
dixit bishwash
asked
Mar 28, 2018
Compiler Design
syntax-directed-translation
compiler-design
parsing
+
–
0
votes
1
answer
251
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 ?
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 dra...
Rahul Ranjan 1
4.9k
views
Rahul Ranjan 1
asked
Mar 19, 2018
Compiler Design
compiler-design
grammar
parsing
ll-parser
left-recursion
+
–
0
votes
3
answers
252
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
253
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
554
views
shivanisrivarshini
asked
Mar 10, 2018
Compiler Design
compiler-design
parsing
ll-parser
lr-parser
descriptive
+
–
1
votes
1
answer
254
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
+
–
2
votes
2
answers
255
Brute Force Parsing
Which of the following can be said about the Exhaustive search parsing or brute force parsing ? It is inefficient as the time taken is proportional to the length of the string. The parser always terminates on the strings in the $L(G)$. The parser always terminates on the strings not in $L(G)$. $\text{1 & 2}$ $\text{2 & 3}$ $\text{1 & 3}$ $\text{1, 2 & 3}$
Which of the following can be said about the Exhaustive search parsing or brute force parsing ?It is inefficient as the time taken is proportional to the length of the st...
tarun_svbk
1.5k
views
tarun_svbk
asked
Feb 24, 2018
Theory of Computation
parsing
theory-of-computation
compiler-design
+
–
0
votes
1
answer
256
Testbook Test Series: Compiler Design - Parsing
nish kim
473
views
nish kim
asked
Feb 14, 2018
Compiler Design
compiler-design
parsing
testbook-test-series
+
–
19
votes
4
answers
257
GATE CSE 2018 | Question: 38
Consider the following parse tree for the expression a#b$\$c$\$d#e#f, involving two binary operators $\$ ... has higher precedence and is right associative; # is left associative
Consider the following parse tree for the expression a#b$\$$c$\$$d#e#f, involving two binary operators $\$$ and #.Which one of the following is correct for the given par...
gatecse
9.3k
views
gatecse
asked
Feb 14, 2018
Compiler Design
gatecse-2018
compiler-design
parsing
normal
2-marks
+
–
0
votes
1
answer
258
top down parsing
why top down parser uses left most derivation? is it mandatory or we can change it by modifying the algo?
why top down parser uses left most derivation? is it mandatory or we can change it by modifying the algo?
bunty choudhary
446
views
bunty choudhary
asked
Feb 9, 2018
Compiler Design
compiler-design
parsing
descriptive
+
–
0
votes
1
answer
259
Test Questiion
$G: S\rightarrow SbS\mid a$ Grammars are ambiguous True/False.
$G: S\rightarrow SbS\mid a$Grammars are ambiguous True/False.
Nikhil Patil
335
views
Nikhil Patil
asked
Feb 7, 2018
Compiler Design
compiler-design
parsing
ambiguous-grammar
true-false
test-series
+
–
0
votes
1
answer
260
SLR(1)
Is the given grammar SLR(1)? $\text{E}\rightarrow \text{T+E | T}$ $\text{T}\rightarrow i$
Is the given grammar SLR(1)?$\text{E}\rightarrow \text{T+E | T}$$\text{T}\rightarrow i$
Mk Utkarsh
720
views
Mk Utkarsh
asked
Feb 1, 2018
Compiler Design
compiler-design
parsing
normal
+
–
1
votes
1
answer
261
Find First and Follow
Find First and Follow of the given grammar $S \rightarrow aSa | bSb|A$ $A \rightarrow aBb$ $B \rightarrow aB|bB|\epsilon$
Find First and Follow of the given grammar$S \rightarrow aSa | bSb|A$$A \rightarrow aBb$$B \rightarrow aB|bB|\epsilon$
Mk Utkarsh
2.6k
views
Mk Utkarsh
asked
Feb 1, 2018
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
262
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
+
–
3
votes
2
answers
263
Compiler: Bottom Up Parser
Given answer is (D), how?
Given answer is (D), how?
Manu Thakur
1.0k
views
Manu Thakur
asked
Jan 27, 2018
Compiler Design
compiler-design
parsing
test-series
+
–
1
votes
1
answer
264
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
+
–
1
votes
2
answers
265
VirtualGate-2018-I-19
Consider the grammar given S->AA A->aA / b How many entries will be blank in the GOTO table for SR(0) items? What is the meaning of SR(0) items?
Consider the grammar givenS->AAA->aA / bHow many entries will be blank in the GOTO table for SR(0) items?What is the meaning of SR(0) items?
Avdhesh Singh Rana
1.4k
views
Avdhesh Singh Rana
asked
Jan 25, 2018
Compiler Design
parsing
grammar
virtual-gate-test-series
+
–
1
votes
0
answers
266
MadeEasy Test Series 2018: Compiler Design - Parsing
Consider the following grammar G: 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) D. Neither LL (1) nor LR (0) Here B should be correct option?
Consider the following grammar G:The grammar G isA. LL (1) grammar and not LR (0)B. LL (1) and LR (0)C. Not LL (1) but LR (0)D. Neither LL (1) nor LR (0)Here B should be ...
rahul sharma 5
271
views
rahul sharma 5
asked
Jan 24, 2018
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
1
votes
1
answer
267
Top Down Parsing
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D -> d first or B -> B first?
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D - d first or B - B f...
vishal chugh
1.0k
views
vishal chugh
asked
Jan 23, 2018
Compiler Design
compiler-design
parsing
test-series
+
–
3
votes
1
answer
268
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
259
views
ankit_thawal
asked
Jan 22, 2018
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
1
votes
1
answer
269
MadeEasy Test Series: Compiler Design - Parsing
Options given A. LL (1) grammar and not LR (0) B. LL (1) and LR (0) C. Not LL (1) but LR (0) D. Neither LL (1) nor LR (0) Answer given is option D. I believe answer should be option (B). Please help.
Options given A. LL (1) grammar and not LR (0)B. LL (1) and LR (0)C. Not LL (1) but LR (0)D. Neither LL (1) nor LR (0)Answer given is option D.I believe answer should be ...
nishitshah
539
views
nishitshah
asked
Jan 21, 2018
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
2
votes
1
answer
270
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
+
–
Page:
« prev
1
...
4
5
6
7
8
9
10
11
12
13
14
...
23
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register