Register

Recent questions tagged parsing

1 votes
1 answer
331
LALR(1)
S-> L=R|R L->*R|id R->L can someone draw the states with lookaheads? i am always getting confused on what should be the lookahead along with the grammar and how to find if there it is LALR(1) or not
S- L=R|RL->*R|idR->Lcan someone draw the states with lookaheads?i am always getting confused on what should be the lookahead along with the grammarand how to find if ther...
User Avatar
0 votes
2 answers
332
Bottom up parsing SDT
User Avatar
2 votes
1 answer
333
virtual gate
Choose the correct answer for following grammar S → Aa | bAc | Bc | bBa A → d B → d (A) It is LL(1), LALR(1), and CLR(1) (B) LR(0), LALR(1), and CLR(1), but not SLR(1) (C) It is CLR(1), but not LL(1), LR(0), SLR(1), LALR(1) (D) It is LALR(1), and CLR(1)
Choose the correct answer for following grammarS → Aa | bAc | Bc | bBaA → dB → d(A) It is LL(1), LALR(1), and CLR(1)(B) LR(0), LALR(1), and CLR(1), but not SLR(1)(C...
User Avatar
1 votes
1 answer
335
parser
1)shift e 2)reduce the configuration 3)sr conflict 4)rr conflict Ques 2 In LL(1) parsing algorithm let X is the topmost symbol of the stack and "a" is a lookahaed symbol then which condition will require to operate only pop on stack 1)X=a=$ 2)X=a <>$ 3)X<>a<>$ 4)none
1)shift e2)reduce the configuration3)sr conflict4)rr conflictQues 2 In LL(1) parsing algorithm let X is the topmost symbol of the stack and "a" is a lookahaed symbol the...
User Avatar
3 votes
1 answer
336
parser
consider the following statements: S1:SLR parsing table have more number of state then LALR parsing table S2:it is economical to construct SLR and LALR table than CLR parsing table . Which one is true?
consider the following statements:S1:SLR parsing table have more number of state then LALR parsing tableS2:it is economical to construct SLR and LALR table than CLR parsi...
User Avatar
2 votes
2 answers
337
parsing
what is the output produced for the input "abdbdc" using bottom up and top down parsing ?
what is the output produced for the input "abdbdc" using bottom up and top down parsing ?
User Avatar
1 votes
0 answers
338
MadeEasy Subject Test: Compiler Design - Parsing
The given answer is 5,i am getting 6 16 in CLR and 10 in LALR.Please someone confirm?
The given answer is 5,i am getting 616 in CLR and 10 in LALR.Please someone confirm?
User Avatar
1 votes
1 answer
340
conflicts
consider a state having this L' -> L. {$} L -> L.b {$,B} does this state have SR coonflict
consider a state having thisL' - L. {$}L - L.b {$,B}does this state have SR coonflict
User Avatar
2 votes
3 answers
341
grammar
Trailing symbols of E E -> E + T | T T -> T * F | F F -> (E) | id
Trailing symbols of EE - E + T | TT - T * F | FF - (E) | id
User Avatar
1 votes
1 answer
342
compiler
S->SAS | a A->AA | b is the grammar a) LR(0) b)SLR(1) c)LALR(1) d)none
S->SAS | aA->AA | bis the grammara) LR(0)b)SLR(1)c)LALR(1)d)none
User Avatar
2 votes
2 answers
343
first and follow
first and follow of S->ABC A->0A1 / epsilon B->1B / epsilon C->1C0 / epsilon
first and follow ofS->ABCA->0A1 / epsilonB->1B / epsilonC->1C0 / epsilon
User Avatar
2 votes
2 answers
344
eliminate left recurrsion
Eliminate left recurrsion from $S\rightarrow S0S1S | 01$
Eliminate left recurrsion from $S\rightarrow S0S1S | 01$
User Avatar
0 votes
2 answers
345
[Compiler Design] Ambiguity
The productions E -> E+E | E-E | E*E | id a:) generates inherently ambiguous languages b:) generates and ambiguous language c:) is an ambiguous grammer d) none of these
The productionsE - E+E | E-E | E*E | ida:) generates inherently ambiguous languagesb:) generates and ambiguous languagec:) is an ambiguous grammerd) none of these
User Avatar
1 votes
2 answers
346
Number of derivation trees
`How many derivation trees are there to derive string"te" from below grammer:- G->ATE | g | $\epsilon$ A->TE | a | $\epsilon$ T-> t | $\epsilon$ E-> e | $\epsilon$
How many derivation trees are there to derive string"te" from below grammer:-G->ATE | g | $\epsilon$A->TE | a | $\epsilon$T- t | $\epsilon$E- e | $\epsilon$
User Avatar
2 votes
0 answers
347
Compiler Design:- Number of conflicts in LR(0)
Consider the following grammer:- Stmts -> Stmt | Stmts;Stmt Stmt -> Var =E Var ->id[E] | id E-> id | (E) Find the number of conflicts in LR(0)?
Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?
User Avatar
0 votes
0 answers
348
Compiler design: Number of rows in parsing table
Consider the following augmented grammar G which is used to build LR (0) parsing table. E' __> E E __> E+T/T T __> T*F/F F -->(E)/id How many rows are there in the parsing rable ? a)11 b)12 c)13 d)14
Consider the following augmented grammar G which is used to build LR (0) parsing table.E' __ EE __ E+T/TT __ T*F/FF >(E)/idHow many rows are there in the parsing rable ?...
User Avatar
2 votes
1 answer
349
self doubt
IS IT NECESSARY TO REMOVE LEFT RECURSION FOR FINDING FIRST AND FOLLOW ??
IS IT NECESSARY TO REMOVE LEFT RECURSION FOR FINDING FIRST AND FOLLOW ??
User Avatar
2 votes
1 answer
350
# Parsing
What are the differences between strong LL(k) parsing and LL(k) parsing?
What are the differences between strong LL(k) parsing and LL(k) parsing?
User Avatar
2 votes
1 answer
351
#Parsing
How to check in the grammar that which parsing method works more efficient for it? For eg in the following grammar - S-> Aa/b S->a Options - a) Top - Down b) Bottom - up c) Both d) None of these Answer is b.
How to check in the grammar that which parsing method works more efficient for it?For eg in the following grammar -S- Aa/bS->aOptions -a) Top - Downb) Bottom - upc) Bothd...
User Avatar
1 votes
0 answers
352
self doubt
can anyone tell me the difference between LL(k) and LR(K) Grammers and can we use k look aheads at once ?? in CLR(1) Parser which is most powerful we use just one lookahead does lookaheads increase power???
can anyone tell me the difference between LL(k) and LR(K) Grammers and can we use k look aheads at once ?? in CLR(1) Parser which is most powerful we use just one lookahe...
User Avatar
0 votes
1 answer
355
Parsing_LR(1)Items
User Avatar
0 votes
0 answers
356
MadeEasy Subject Test: Compiler Design - Parsing
Let G be a grammar with the following productions. If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item in the initial state?
Let G be a grammar with the following productions.If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
User Avatar
0 votes
1 answer
357
Ace Test Series: Compiler Design - Parsing
S -> Aa A -> Ab A -> c Which of the following item is present in LR(1) item with S' -> .S, $\$ ? A) A -> .Ab, $\$ B) A -> .c, $\$ C) A -> .Ab, a/b D) None
S - AaA - AbA - cWhich of the following item is present in LR(1) item with S' - .S, $\$$ ?A) A - .Ab, $\$$B) A - .c, $\$$C) A - .Ab, a/bD) None
User Avatar
1 votes
2 answers
358
parsing
S---->AaAb /BbBa A---->epsilon B------->epsilon check whether grammar is LL(1),LR(0) OR SLR(1)
S >AaAb /BbBaA >epsilonB ->epsiloncheck whether grammar is LL(1),LR(0) OR SLR(1)
User Avatar
Page: