To develop a parser for cactus languages in a functional programming style takes a way to express the description of a PARC in terms of its nodes, by recursion from the root up. That requires each node to be specified by a functional expression, having a call of the generic function name be followed by a list of arguments naming the attachments of the node in question and having a call of the generic function name
be followed by a list of arguments naming the appendants of the lobe in question. Thus one writes expressions of the following forms.
Working from a structural description of the cactus language, or any suitable formal grammar for it is possible to give a recursive definition of a function called
which maps each expression in
to the corresponding graph in
One way to do that proceeds as follows.
- The Concatenation
of the
sentences
has a Parse defined as follows.
- For
- The Surcatenation
of the
sentences
has a Parse defined as follows.
- For
Resources
cc: Academia.edu • BlueSky • Laws of Form • Mathstodon • Research Gate
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science

Pingback: Survey of Animated Logical Graphs • 8 | Inquiry Into Inquiry
Pingback: Cactus Language • Mechanics 5 | Inquiry Into Inquiry
Pingback: Survey of Animated Logical Graphs • 8 | Systems Community of Inquiry