Question 3:

As part of the design for the SDG game,
we need the capabaility to define simple class dictionaries that
define raw materials, predicates to define derivatives and
finished products.
We have chosen the following cd to define cds.

Cd_graph = "sdg" "class" "dictionary" <cd> NAdj_list EOF.
NAdj_list = <first> Adj <rest> Adj_list  .
Adj = "type" <vertex> Vertex <ns> Neighbors .
Neighbors: Product | Sum.
Product = "product" "(" <c_ns> Any_vertex_list ")".
Sum = "sum" "(" <first> Vertex "|" <second> Vertex ")".
Any_vertex : Labeled_vertex | Syntax_vertex.
Syntax_vertex = <string> String.
Labeled_vertex = <label_name> ident ":" 
                     <class_name> Vertex.
Adj_list: NAdj_list | Empty_Adj_list .
Any_vertex_list: Nany_vertex_list | Empty_vl.
Nany_vertex_list = 
<first> Any_vertex <rest> Any_vertex_list.
Empty_vl = .
Empty_Adj_list = .
Vertex = <name> ident.


Part a:
Use this cd to define a cd for describing instances of the knapsack problem.

Part b:
Use this cd to define a cd for CSP raw materials very similar to the cd that is used in your robot.

Part c:
Use this cd to define itself (first 4 classes only: