Contents
Prev
Next
Page+10
Every parsing based on a Context Free Grammar produces:
A:
a linked list
B:
a binary tree
C:
a tree
D:
a directed acyclic graph
E:
a graph, possibly with cycles
Answer