Answer

Correct Option: (iii) Parse tree

Explanation

Parse tree (derivation tree / syntax tree): Acyclic, rooted, ordered tree representing derivation.

• Root = start symbol $S$
• Internal nodes = non-terminals
• Leaves = terminals (yield = derived string)
• No cycles (grammar is context-free, derivation finite).

Not binary tree specifically (parse tree can be $n$-ary), not octtree. Binary tree is for CNF.

Final Answer

Parse tree → Option (iii).