Register

Recent questions tagged parsing

0 votes
0 answers
211
#selfdoubt #SLR & LALR
Can LALR have more reduce entries than SLR ? As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less than or equal to those in SLR. Is it correct?, please verify.
Can LALR have more reduce entries than SLR ?As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less ...
User Avatar
0 votes
0 answers
212
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
0 votes
2 answers
213
FIRST Set
S->Aa A->BD B->b | ɛ D->d | ɛ what is FIRST(S)?
S->AaA->BDB->b | ɛD->d | ɛwhat is FIRST(S)?
User Avatar
0 votes
1 answer
214
LR(k) grammar doubt
Do every LR(1) grammar have DPDA?
Do every LR(1) grammar have DPDA?
User Avatar
0 votes
1 answer
215
Parsing
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
User Avatar
0 votes
1 answer
216
Parser
Bottom up parser uses right hand derivation or left hand derivation????
Bottom up parser uses right hand derivation or left hand derivation????
User Avatar
4 votes
0 answers
217
MadeEasy Test Series: Compiler Design - Parsing
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. The number of entries have multiple productions in LL(1) table are ________.
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production.The number of entries have multiple productions in LL(1) ...
User Avatar
0 votes
2 answers
220
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
0 votes
2 answers
221
UGC NET CSE | July 2018 | Part 2 | Question: 39
A bottom-up parser generates: Left-most derivation in reverse Right-most derivation in reverse Left-most derivation Right-most derivation
A bottom-up parser generates:Left-most derivation in reverseRight-most derivation in reverseLeft-most derivationRight-most derivation
User Avatar
0 votes
1 answer
222
Bottom Up parsers
Does bottom up parsers give postfix expression?
Does bottom up parsers give postfix expression?
User Avatar
1 votes
1 answer
224
SR conflict in LALR(1)
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$ It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?...
User Avatar
1 votes
1 answer
225
"A bottom up parser tries to find the right most deviation of the given input in the reverse order
"A bottom up parser tries to find the right most deviation of the given input in the reverse order " what does this line mean Please Explain
"A bottom up parser tries to find the right most deviation of the given input in the reverse order " what does this line mean Please Explain
User Avatar
0 votes
0 answers
227
MadeEasy Test Series: 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 T → .T * F 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
228
Parse tree
How to make a parse tree for the expression $a+b*c/b*c*f?$
How to make a parse tree for the expression$a+b*c/b*c*f?$
User Avatar
0 votes
1 answer
229
Follow
Compute follow of the following grammar? $E \rightarrow TE'$ $E' \rightarrow +TE'/\epsilon$ $T \rightarrow FT'$ $T' \rightarrow ^*FT'/\epsilon$ $F \rightarrow (E)/id$
Compute follow of the following grammar?$E \rightarrow TE'$$E' \rightarrow +TE'/\epsilon$$T \rightarrow FT'$$T' \rightarrow ^*FT'/\epsilon$$F \rightarrow (E)/id$
User Avatar
0 votes
1 answer
230
Parse tree
Consider the following grammar $S \rightarrow SS/Sa/aS/a$ Construct Parse Tree for $w=aaaa$ as many as possible? How many parse trees are possible?
Consider the following grammar$S \rightarrow SS/Sa/aS/a$Construct Parse Tree for $w=aaaa$ as many as possible? How many parse trees are possible?
User Avatar
0 votes
1 answer
232
First and follow
Find first and follow of the given grammar? S->AB A->BS/a/€ B->AS/b
Find first and follow of the given grammar?S->ABA->BS/a/€B->AS/b
User Avatar
0 votes
2 answers
234
Compiler design
User Avatar
2 votes
3 answers
240
Ambiguous and unambiguous grammar
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ? Or we say a grammar is ambiguous only when it has more than one left most derivation ?
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ?Or we say a grammar is ambiguous only when it has more than one left most deriv...
User Avatar
Page: