Register

Recent questions tagged parsing

0 votes
1 answer
601
shift reduce
User Avatar
0 votes
1 answer
603
Compiler question
I did in this way : There is conflict , right ? As A -> g. and B -> g. both going to $ and g
I did in this way :There is conflict , right ? As A - g. and B - g. both going to $ and g
User Avatar
0 votes
1 answer
604
Is there three SR conflict in the CLR(1) grammar
Will not there be 3 SR conflicts in CLR(1) reduction ? In fact their ans also says this : In the state I1 , will it not be SR conflict ?
Will not there be 3 SR conflicts in CLR(1) reduction ?In fact their ans also says this :In the state I1 , will it not be SR conflict ?
User Avatar
0 votes
1 answer
605
parsing
User Avatar
2 votes
1 answer
608
Slr(1)
S->aAb/aBc/bAd/bBe A->g B->g How many states in slr(1)
S->aAb/aBc/bAd/bBeA->gB->gHow many states in slr(1)
User Avatar
2 votes
1 answer
609
Conflict
If lalr(1) has no conflict then clr(1) never contain any conflict It is true or false If it is false explain
If lalr(1) has no conflict then clr(1) never contain any conflictIt is true or falseIf it is false explain
User Avatar
2 votes
2 answers
610
Is $ a terminal or not ?
Follow(S) comes as {(, ). $ } So, do we count $ ... is also marker to identify that parsing of string has been successfully completed.
Follow(S) comes as {(, ). $ }So, do we count $ as terminal or not.Could anyone please tell me, $ should be considered as terminal or not ? Although I think, I should not...
User Avatar
0 votes
1 answer
611
Lr(k)
User Avatar
3 votes
3 answers
613
If a grammar is parsed by LR(0) will it always be LL(1)..??
Q1. Are all LR(0) grammars LL(1) ...?? Please provide an example if not. Q2. Does all parsing methods parses only DCFL ..?? PS. Is it true for general case that LR(k) => LL(k+1)
Q1. Are all LR(0) grammars LL(1) ...??Please provide an example if not.Q2. Does all parsing methods parses only DCFL ..??PS. Is it true for general case that LR(k) = LL(k...
User Avatar
0 votes
1 answer
615
Parsing2
Can a grammar which is not LL can be SLR? where will you fit LL in sequence below: LR(0) => SLR => LALR => LR * => stands for implies
Can a grammar which is not LL can be SLR?where will you fit LL in sequence below:LR(0) = SLR = LALR = LR * = stands for implies
User Avatar
0 votes
1 answer
616
Parsing
Can anybody enumerate the similarities and dissimilarities between LL, SLR, LALR and LR parsers.
Can anybody enumerate the similarities and dissimilarities between LL, SLR, LALR and LR parsers.
User Avatar
0 votes
1 answer
617
SR conflict
Which of the following set could result SR conflict in LALR(1)? a) A→ a.b, {b} B→ a. , {a} b) A→ a.a , {a} B→ a. , {b} c) A→ b.a , {b} B→ b.,{a} d) A→ b.b , {a} B→ b. , {a}
Which of the following set could result SR conflict in LALR(1)?a) A→ a.b, {b} B→ a. , {a}b) A→ a.a , {a} B→ a. , {b}c) A→ b.a , {b} B→ b.,{a}d) A→ b...
User Avatar
1 votes
2 answers
618
Compiler
Consider the following grammer S→ bAd /bBe A→a B→a The above grammer is ________________ 1) SLR(1) 2) LALR(1) but not SLR(1) 3) CLR(1) but not LALR(1) d) Not LR(1)
Consider the following grammerS→ bAd /bBeA→aB→aThe above grammer is ________________1) SLR(1)2) LALR(1) but not SLR(1)3) CLR(1) but not LALR(1)d) Not LR(1)
User Avatar
1 votes
3 answers
619
SR conflict
Which of the following could result in Shift-Reduce conflict in LR(0) parser? 1){ A→ b.c ,B→b. } 2){A→a.b,B→b. } 3) {A→∊. , B→.a} 4)All of these
Which of the following could result in Shift-Reduce conflict in LR(0) parser?1){ A→ b.c ,B→b. }2){A→a.b,B→b. }3) {A→∊. , B→.a}4)All of these
User Avatar
0 votes
2 answers
620
CLR
S'→S S→A/B A→fAi/n B→fBii/d For the above augmented grammer , the number of states in LR(1) parser are_______________
S'→SS→A/BA→fAi/nB→fBii/dFor the above augmented grammer , the number of states in LR(1) parser are_______________
User Avatar
3 votes
1 answer
621
LL(*) grammar
give example for LL(*) grammar
give example for LL(*) grammar
User Avatar
11 votes
2 answers
626
LL(1) expressive power
Does there exist LL(1) grammar for every Regular Language ? OR For Every Regular Language there exist atleast one LL(1) Grammar . True /False
Does there exist LL(1) grammar for every Regular Language ? ORFor Every Regular Language there exist atleast one LL(1) Grammar . True /False
User Avatar
5 votes
3 answers
627
LL(1)
Consider the grammar $S \to AaAb \mid BbBa$ $A \to \epsilon$ $B \to \epsilon$ This grammar is LL(1)- True or false
Consider the grammar $S \to AaAb \mid BbBa$ $A \to \epsilon$$B \to \epsilon$ This grammar is LL(1)- True or false
User Avatar
4 votes
1 answer
629
Identify the type of Grammar ?
Identify the type of the grammar and give justification S $\rightarrow$ XYc X $\rightarrow$ Yb | a Y $\rightarrow$ c | $\epsilon$ SLR(1) Not SLR(1) LR(1) LALR(1) Someone please explain me it with state diagram . I'm confused with $\epsilon$ in the I0 Closure
Identify the type of the grammar and give justificationS $\rightarrow$ XYcX $\rightarrow$ Yb | aY $\rightarrow$ c | $\epsilon$ SLR(1)Not SLR(1)LR(1)LALR(1)Someone please ...
User Avatar
Page: