1.

Q2. Consider the following Context Free Grammar (CFG)→ | → | → | where {a, b, c, d, e} is the set of terminal symbols.a. Give a right-most derivation of ecadeb.b. Give a left-most derivation of ecadeb.c. Compute FIRST and FOLLOW for this grammar?d. Discuss whether CFG is ambiguous or not and draw the parsing tree?

Answer»

ANSWER:

hi

Explanation:

my NAME is NOOR FATEMA



Discussion

No Comment Found