Register

Recent questions tagged ll-parser

0 votes
0 answers
31
Self doubt
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1). What is the meaning of expressive power? I know that LR(0)<SLR(1)<LALR(1)<CLR(1), what is the meaning of this?
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1).What is the meaning of expressive power? I know thatLR(0)<SLR(1)<LALR(1)<...
User Avatar
1 votes
0 answers
32
Doubt
A LL(k) parser recognizes the languages generated by some ε-free LL(k) grammar. (From Wikiepedia) Why epsilon free LL(k) grammar?
A LL(k) parser recognizes the languages generated by some ε-free LL(k) grammar. (From Wikiepedia)Why epsilon free LL(k) grammar?
User Avatar
0 votes
2 answers
34
Tell me the answer plsss
S-> ABA A-> Bc|dA|€ B-> eA How many entries have multiple production in LL (1) table
S- ABAA- Bc|dA|€B- eA How many entries have multiple production in LL (1) table
User Avatar
1 votes
1 answer
35
LL(1)
Check whether the following grammar is $LL(1)$ or not? $S \rightarrow aAbA/Ba$ $B \rightarrow b/ \epsilon$ $A \rightarrow aBb/ \epsilon$
Check whether the following grammar is $LL(1)$ or not?$S \rightarrow aAbA/Ba$$B \rightarrow b/ \epsilon$$A \rightarrow aBb/ \epsilon$
User Avatar
0 votes
1 answer
36
Compiler design
$\ $ S->( L)|a L->L,S|S While parsing string ( a,((a,a),(a,a))) generated by the above grammar ,using predictive parsing table ,what is the maximum number of data item in stack at an instant________?
$\ $ S->( L)|a L->L,S|SWhile parsing string ( a,((a,a),(a,a))) generated by the above grammar ,using predictive parsing table ,what is the maximum number of data item ...
User Avatar
0 votes
1 answer
37
Compiler design
In this why questions why the left recursion is not removed as it is necessary for $LL1 $ Why they given the option without removing the left recursion $S->Aa|b$ $A->Ac|Sd|Null$
In this why questions why the left recursion is not removed as it is necessary for $LL1 $Why they given the option without removing the left recursion$S->Aa|b$$A->Ac|Sd|N...
User Avatar
0 votes
2 answers
39
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).
User Avatar
0 votes
0 answers
40
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?
User Avatar
0 votes
1 answer
42
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...
User Avatar
0 votes
1 answer
43
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
User Avatar
0 votes
0 answers
45
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...
User Avatar
2 votes
1 answer
46
LL(1)
Which of the following is LL(1) conflict? a)FIRST/FIRST conflict b)FIRST/FOLLOW conflict c) both d)none
Which of the following is LL(1) conflict?a)FIRST/FIRST conflictb)FIRST/FOLLOW conflictc) bothd)none
User Avatar
0 votes
0 answers
48
#doubt
Statement 1 : For every DCFL there exits a LR(0) or a LR(1) grammer. Statement 2 : For every DCFL there exits a LR(1) grammer. Which is true??
Statement 1 : For every DCFL there exits a LR(0) or a LR(1) grammer.Statement 2 : For every DCFL there exits a LR(1) grammer.Which is true??
User Avatar
0 votes
0 answers
50
#LL(k)
How to determine whether a grammar is LL(K) or LR(0) or SLR(1)?
How to determine whether a grammar is LL(K) or LR(0) or SLR(1)?
User Avatar
0 votes
1 answer
51
LL(1)
User Avatar
0 votes
0 answers
54
LL(1)
User Avatar
0 votes
2 answers
55
Parsing
I think that the given grammar is LL(1) . please explain me if I'm wrong.
I think that the given grammar is LL(1) . please explain me if I'm wrong.
User Avatar
0 votes
0 answers
56
self doubt
Let us say + and * are both left and right associative then how is expression evaluated in top down parse? E- E*E / E+E / num Does it follow left most derivation?
Let us say + and * are both left and right associative then how is expression evaluated in top down parse?E- E*E/ E+E/ numDoes it follow left most derivation?
User Avatar
2 votes
1 answer
57
parser
every LL(k) grammer is also SLR(k) grammer. (true / false)
every LL(k) grammer is also SLR(k) grammer. (true / false)
User Avatar
8 votes
3 answers
58
Finding type of Grammar LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...
User Avatar
0 votes
0 answers
59
Compiler : LL(k) and LR(k) grammer
Can LL(k) and LR(k) gammer has null and unit productions?
Can LL(k) and LR(k) gammer has null and unit productions?
User Avatar
Page: