Consider the following grammar rule: N rightarrow a((Cb) * B|Ac|Ab)b, where N, A

Question

Consider the following grammar rule: N rightarrow a((Cb) * B|Ac|Ab)b, where N, A, B, C are nonterminals, and a, b, c are terminals. Note that (Cb) * could be empty and this creates another case and A, B could be empty also. Analyzing all possible cases for the switch statement when building a recursive descent parser for a grammar which includes this grammar rule. b) Write a piece of pseudo-code for the procedure parse N(), which parses N, the non-terminal on the left-side of the following grammar rule.

Explanation / Answer

let us find the language first

N=a or

N=c or

N=bb

so this is the language which may be produced by the given grammer

so the cases for swithc statement can be

switch(a)

switch(bb)

switch(c)

b)

if C=empty && B=empty

then

N=a(fpr first grammer)

if A= empty /null

then N=c

if A=empty/null

then N=bb

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.