Question

__________ is the acyclic graphical representation of a grammar.

(a) Binary tree

(b) Oct tree

(c) Parse tree

(d) None of the mentioned

I got this question by my college professor while I was bunking the class.

This question is from Construction and Yield of a Parse Tree topic in chapter Context Free Grammars and Languages of Automata Theory

Answer 1

Right answer is (c) Parse tree

Explanation: In order to graphically represent a derivation of a grammar we need to use parse trees.