Register

doubt CD

• edited by
575 views
0 0 votes

7. Consider the following grammar:
\[
\begin{array}{l}
S \rightarrow r X \mid r R x \\
R \rightarrow X R x \mid r \\
X \rightarrow X X \mid \epsilon
\end{array}
\]

How many back tracks are required to generate the string 'rrx' from the above grammar?

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · MadeEasy CBT 2017:Ge...Next → · MadeEasy CBT 2017: A...
← Previous in category · self doubtNext in category → · Doubts
Position:
Show:

Related questions

3 3 votes
1 1 answer
2.5k
2.5k views
mohitbawankar asked Jan 10, 2018
2,496 views
MOCK TEST compiler design
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
5 5 votes
1 1 answer
1.1k
1.1k views
mcjoshi asked Nov 9, 2016
1,070 views
CD Doubt:
Please Provide valid explanation in support of your answer.6. For which of the following situations, inherited attribute is a natural choice?Evaluation of arithmetic expr...
0 0 votes
1 1 answer
1.8k
1.8k views
Na462 asked Oct 8, 2018
1,772 views
L attributed grammer
I know that every S attributed grammar is L attributed but not vice versa. Can anybody give example of the case if i print the semantic rules using L attributed the resul...
0 0 votes
1 1 answer
426
426 views
Shivani gaikawad asked May 31, 2018
426 views
compiler design
The given grammar is:\[\mathrm{G}=\{(\mathrm{S}),\{\mathrm{a}, \mathrm{~b}\},\{\mathrm{S} \rightarrow \mathrm{SaS}, \mathrm{~S} \rightarrow \mathrm{~b}\}, \mathrm{S}\}\]L...