Background Terminal and nonterminal functions

a simple parse tree.

a parse tree made of nodes , branches. in picture below parse tree entire structure, starting s , ending in each of leaf nodes (john,ball,the,hit).

in parse tree, each node either root node, branch node, or leaf node. in above example, s root node, np , vp branch nodes, while john, ball, the, , hit leaf nodes.

nodes can referred parent nodes , child nodes. parent node 1 has @ least 1 other node linked branch under it. in example, s parent of both np , vp. child node 1 has @ least 1 node directly above linked branch of tree. again our example, hit child node of v.