Register

Recent questions tagged grammar

0 votes
1 answer
1
FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
0 answers
3
viable prefix
Consider a grammar G. Given below is the sentential form of G to derive a string W = –(id + id) and E is the starting symbol of G. E -> –E E -> –(E) E -> –(E+E) E -> –(id+E) E -> –(id+id) Which of the option is not viable prefix of any sentential form?
Consider a grammar G. Given below is the sentential form of G to derive a string W = –(id + id) and E is the starting symbol of G.E - –EE - –(E)E - –(E+E)E - –(...
User Avatar
0 votes
0 answers
4
compiler design
how many handles are 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 are 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 ri...
User Avatar
2 votes
1 answer
7
ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?
I don’t get the explanation, How do you categorize grammer on the basis of production?
User Avatar
0 votes
0 answers
9
UGC NET CSE | October 2022 | Part 1 | Question: 83
Consider the grammer $\mathrm{S} \rightarrow \mathrm{SbS} \mid \mathrm{a}$ ... true, Only $\text{(B)}$ is true Only $\text{(C)}$ is true Only $\text{(A)}$ is true
Consider the grammer $\mathrm{S} \rightarrow \mathrm{SbS} \mid \mathrm{a}$.Consider the following statements:The string abababa has(A) two parse trees(B) two left most de...
User Avatar
2 votes
2 answers
12
Is the following grammar LL(1) ?
Is the following grammar LL(1) ? S→ aABbCD | ϵ A→ ASd | ϵ B→ Sac| hC | ϵ C→ Sf |Cg D→ aBD | ϵ Draw the LL(1) parsing table for the given grammar.
Is the following grammar LL(1) ?S→ aABbCD | ϵA→ ASd | ϵB→ Sac| hC | ϵC→ Sf |CgD→ aBD | ϵDraw the LL(1) parsing table for the given grammar.
User Avatar
0 votes
1 answer
13
Compute FIRST and FOLLOW sets
Compute FIRST and FOLLOW sets: S→ aAC | bB A→ Abc| Abd | e B→ f | g C→ h | i
Compute FIRST and FOLLOW sets:S→ aAC | bBA→ Abc| Abd | eB→ f | gC→ h | i
User Avatar
13 votes
2 answers
16
GATE CSE 2021 Set 1 | Question: 31
Consider the following context-free grammar where the set of terminals is $\{a,b,c,d,f\}$ ...
Consider the following context-free grammar where the set of terminals is $\{a,b,c,d,f\}$. $$\begin{array}{lll} \text{S} & \rightarrow & d \: a \: \text{T} \mid \text{R} ...
User Avatar
2 votes
1 answer
19
NIELIT 2017 DEC Scientist B - Section B: 33
Which of the following statements is/are false? $S1$: $LR(0)$ grammar and $SLR(1)$ grammar are equivalent $S2$: $LR(1)$ grammar are subset of $LALR(1)$ grammars $S1$ only $S1$ and $S2$ both $S2$ only None of the options
Which of the following statements is/are false?$S1$: $LR(0)$ grammar and $SLR(1)$ grammar are equivalent$S2$: $LR(1)$ grammar are subset of $LALR(1)$ grammars$S1$ only$S1...
User Avatar
0 votes
2 answers
21
UGC NET CSE | June 2005 | Part 2 | Question: 32
Which of the following is the most general phase – structured grammar ? Regular Context – Sensitive Context free None of these
Which of the following is the most general phase – structured grammar ?RegularContext – SensitiveContext freeNone of these
User Avatar
Page: