Changes

Grammar&nbsp;1 is something of a misnomer.  It is nowhere near exemplifying any kind of a standard form and it is only intended as a starting point for the initiation of more respectable grammars.  Such as it is, it uses the terminal alphabet <math>\mathfrak{A} = \mathfrak{M} \cup \mathfrak{P}</math> that comes with the territory of the cactus language <math>\mathfrak{C} (\mathfrak{P}),</math> it specifies <math>\mathfrak{Q} = \emptyset,</math> in other words, it employs no intermediate symbols, and it embodies the ''covering set'' <math>\mathfrak{K}</math> as listed in the following display.

Grammar&nbsp;1 is something of a misnomer.  It is nowhere near exemplifying any kind of a standard form and it is only intended as a starting point for the initiation of more respectable grammars.  Such as it is, it uses the terminal alphabet <math>\mathfrak{A} = \mathfrak{M} \cup \mathfrak{P}</math> that comes with the territory of the cactus language <math>\mathfrak{C} (\mathfrak{P}),</math> it specifies <math>\mathfrak{Q} = \emptyset,</math> in other words, it employs no intermediate symbols, and it embodies the ''covering set'' <math>\mathfrak{K}</math> as listed in the following display.

{| align="center" cellpadding="12" cellspacing="0" style="border-top:1px solid black" width="90%"

{| align="center" cellpadding="12" cellspacing="0" style="border-top:1px solid black" width="90%"

|}

|}

<pre>

<br>

 

In this formulation, the last two lines specify that:

In this formulation, the last two lines specify that:

5.  The concept of a sentence in !L! covers any

    concatenation of sentences in !L!, in effect,

 

    any number of freely chosen sentences that are

<li value="5"> The concept of a sentence in <math>\mathfrak{L}</math> covers any concatenation of sentences in <math>\mathfrak{L},</math> in effect, any number of freely chosen sentences that are available to be concatenated one after another.</li>

    available to be concatenated one after another.

6.  The concept of a sentence in !L! covers any

<li value="6"> The concept of a sentence in <math>\mathfrak{L}</math> covers any surcatenation of sentences in <math>\mathfrak{L},</math> in effect, any string that opens with a <math>^{\backprime\backprime} \, \operatorname{(} \, ^{\prime\prime},</math> continues with a sentence, possibly empty, follows with a finite number of phrases of the form <math>^{\backprime\backprime} \operatorname{,} ^{\prime\prime} \, \cdot \, S,</math> and closes with a <math>^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}.</math></li>

    surcatenation of sentences in !L!, in effect,

    any string that opens with a "-(", continues

    with a sentence, possibly empty, follows with

    a finite number of phrases of the form "," · S,

    and closes with a ")-".

This appears to be just about the most concise description

This appears to be just about the most concise description

of the cactus language !C!(!P!) that one can imagine, but

of the cactus language !C!(!P!) that one can imagine, but