(a) Translate the arithmetic expression a * −(b + c) into syntax tree. (b) A…
PYQ GATE 1995
(a) Translate the arithmetic expression a * −(b + c) into syntax tree.
(b) A grammar is said to have cycles if it is the case that A ⇒⁺ A. Show that no grammar that has cycles can be LL(1).
Sign up free to check your answer
Sign up freeLoading lesson…

