12,080
edits
Changes
Directory:Jon Awbrey/Papers/Cactus Language (view source)
Revision as of 16:04, 4 January 2009
, 16:04, 4 January 2009→Grammar 1: markup
In sum, one introduces a non-terminal symbol for each type of sentence and each ''part of speech'' or sentential component that is generated by means of iteration or recursion under the ruling constraints of the grammar. In order to do this one needs to analyze the iteration of each grammatical operation in a way that is analogous to a mathematically inductive definition, but further in a way that is not forced explicitly to recognize a distinct and separate type of expression merely to account for and to recount every increment in the parameter of iteration.
In sum, one introduces a non-terminal symbol for each type of sentence and each ''part of speech'' or sentential component that is generated by means of iteration or recursion under the ruling constraints of the grammar. In order to do this one needs to analyze the iteration of each grammatical operation in a way that is analogous to a mathematically inductive definition, but further in a way that is not forced explicitly to recognize a distinct and separate type of expression merely to account for and to recount every increment in the parameter of iteration.
Returning to the case of the cactus language, the process of recognizing an iterative type or a recursive type can be illustrated in the following way. The operative phrases in the simplest sort of recursive definition are its ''initial part'' and its ''generic part''. For the cactus language <math>\mathfrak{C} (\mathfrak{P}),</math> one has the following definitions of concatenation as iterated precatenation and of surcatenation as iterated subcatenation, respectively:
<pre>
<pre>
1. Conc^0 = "".
1. Conc^0 = "".