We cannot use an off-the-shelf syntax parser to create a tree for the chain because the chain may not necessarily be a coherent English statement.
we build two Directed Acyclic Graph (DAG) structures by heuristics.