Register

Recent questions tagged parsing

0 votes
0 answers
32
compiler design
how many handles detected by bottom up parser for string a+a*a? grammar is E->E+T|T T->T*F|F F->a please draw the whole procedure and explain how bottom up parser does right most derivation in reverse in this question
how many handles detected by bottom up parser for string a+a*a?grammar isE->E+T|TT->T*F|FF->aplease draw the whole procedure and explain how bottom up parser does right m...
User Avatar
0 votes
1 answer
33
made easy gate cs 23 test series
Given a grammar: there is a right most derivation S1 → Sc → SAc → SaSbc. Thus, SaSbc is a right sentential form, and its handle is __
Given a grammar:there is a right most derivation S1 → Sc → SAc → SaSbc.Thus, SaSbc is a right sentential form, and its handle is __
User Avatar
0 votes
0 answers
34
made easy gate 23 test series
Consider the following grammar: 1. S → CC 2. C → cC 3. C → d The number error entries in canonical parsing table for grammar is __.
Consider the following grammar:1. S → CC2. C → cC3. C → dThe number error entries in canonical parsing table for grammar is __.
User Avatar
1 votes
0 answers
35
made easy gate 23 test series
The following grammer is: LALR(1) but not LR(1) LR(1) but not LALR(1) LALR(1) but not SLR(1) Neither LALR(1) nor LR(1)
The following grammer is:LALR(1) but not LR(1)LR(1) but not LALR(1)LALR(1) but not SLR(1)Neither LALR(1) nor LR(1)
User Avatar
0 votes
0 answers
36
Bottom-Up-Parser
Answer the Question with Proper Explanation…. S → Aa / bAc / dc / bda A → ε The Above Grammar is – Neither LR(0) nor SLR(1). LR(0) but not SLR(1). SLR(1) but not LR(0). Both LR(0) & SLR(1).
Answer the Question with Proper Explanation….S → Aa / bAc / dc / bdaA → ε The Above Grammar is –Neither LR(0) nor SLR(1).LR(0) but not SLR(1).SLR(1) but not LR(0...
User Avatar
0 votes
1 answer
37
UGC NET CSE | June 2023 | Part 2: 27
Which of the following parser is most powerful parser? Operator precedence $\text{SLR}$ Canonical $\text{LR}$ $\text{LALR}$
Which of the following parser is most powerful parser?Operator precedence$\text{SLR}$Canonical $\text{LR}$$\text{LALR}$
User Avatar
0 votes
2 answers
38
LR Bottom up parsing table.
User Avatar
0 votes
1 answer
43
Compiler Design (Parsing)
S -> L = R S -> R L -> * R L -> id R -> L Is given CFG LR(0) & SLR(1)?
S - L = RS - RL - * RL - idR - LIs given CFG LR(0) & SLR(1)?
User Avatar
0 votes
1 answer
44
please solve
User Avatar
Page: