| a lobe with the accoutrements <math>C_1, \ldots, C_k.</math>
| a lobe with the accoutrements <math>C_1, \ldots, C_k.</math>
|}
|}
+
+
Working from a structural description of the cactus language, or any suitable formal grammar for <math>\mathfrak{C} (\mathfrak{P}),</math> it is possible to give a recursive definition of the function called <math>\operatorname{Parse}</math> that maps each sentence in <math>\operatorname{PARCE} (\mathfrak{P})</math> to the corresponding graph in <math>\operatorname{PARC} (\mathfrak{P}).</math> One way to do this proceeds as follows:
<pre>
<pre>
−
Working from a structural description of the cactus language,
−
or any suitable formal grammar for !C!(!P!), it is possible to
−
give a recursive definition of the function called "Parse" that
−
maps each sentence in PARCE(!P!) to the corresponding graph in
−
PARC(!P!). One way to do this proceeds as follows:
−
1. The parse of the concatenation Conc^k of the k sentences S_j,
1. The parse of the concatenation Conc^k of the k sentences S_j,
for j = 1 to k, is defined recursively as follows:
for j = 1 to k, is defined recursively as follows: