Line 715:
Line 715:
Returning to the case of the painted cactus language <math>\mathfrak{L} = \mathfrak{C} (\mathfrak{P}),</math> it is possible to put the currently assembled pieces of a grammar together in the light of the presently adopted canons of style, to arrive a more refined analysis of the fact that the concept of a sentence covers any concatenation of sentences and any surcatenation of sentences, and so to obtain the following form of a grammar:
Returning to the case of the painted cactus language <math>\mathfrak{L} = \mathfrak{C} (\mathfrak{P}),</math> it is possible to put the currently assembled pieces of a grammar together in the light of the presently adopted canons of style, to arrive a more refined analysis of the fact that the concept of a sentence covers any concatenation of sentences and any surcatenation of sentences, and so to obtain the following form of a grammar:
+
+
{| align="center" cellpadding="12" cellspacing="0" style="border-top:1px solid black" width="90%"
+
| align="left" style="border-left:1px solid black;" width="33%" |
+
<math>\mathfrak{C} (\mathfrak{P})</math>
+
| align="center" |
+
<math>\text{Grammar 2}\!</math>
+
| align="right" style="border-right:1px solid black;" width="33%" |
+
<math>\mathfrak{Q} = \{ ^{\backprime\backprime} \operatorname{T} ^{\prime\prime} \}</math>
+
|-
+
| colspan="3" style="border-top:1px solid black; border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black" |
+
<math>\begin{array}{llll}
+
1.
+
& S
+
& :>
+
& \varepsilon
+
\\
+
2.
+
& S
+
& :>
+
& m_1
+
\\
+
3.
+
& S
+
& :>
+
& p_j, \, \text{for each} \, j \in J
+
\\
+
4.
+
& S
+
& :>
+
& S \, \cdot \, S
+
\\
+
5.
+
& S
+
& :>
+
& ^{\backprime\backprime} \, \operatorname{(} \, ^{\prime\prime} \, \cdot \, T \, \cdot \, ^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}
+
\\
+
6.
+
& T
+
& :>
+
& S
+
\\
+
7.
+
& T
+
& :>
+
& T \, \cdot \, ^{\backprime\backprime} \operatorname{,} ^{\prime\prime} \, \cdot \, S
+
\\
+
\end{array}</math>
+
|}
<pre>
<pre>
−
| !C!(!P!). Grammar 2
−
|
−
| !Q! = {"T"}
−
|
−
| 1. S :> !e!
−
|
−
| 2. S :> m_1
−
|
−
| 3. S :> p_j, for each j in J
−
|
−
| 4. S :> S · S
−
|
−
| 5. S :> "-(" · T · ")-"
−
|
−
| 6. T :> S
−
|
−
| 7. T :> T · "," · S
−
In this rendition, a string of type T is not in general
In this rendition, a string of type T is not in general
a sentence itself but a proper "part of speech", that is,
a sentence itself but a proper "part of speech", that is,