On Sun, Sep 23, 2012 at 3:25 PM, Jorge Llambías
<jjllambias@hidden.email> wrote:
On Sun, Sep 23, 2012 at 1:23 PM, Mike S. <
maikxlx@gmail.com> wrote:
>
> modifier := term | termlist
>
> termlist := “he” explicit-sentence? | term termlist | “j” V
> explicit-sentence? termlist termlist
>
> term := unary-operator | binary-operator formula
Yes, but it doesn't seem that combining termlists (really, they're termtrees; sorry to keep changing the labels) with binders makes a lot of
sense, because termtrees are meant to be a shortcut for related
sentences with the same predication, and binders impose an asymmetrical
structure.
> I notice that (hypothetically) if we permitted all "n-" operators to be
> introduced into the grammar syncategorematically, then we could give
> different n-words different syntaxes. Since we don't have a lot of n-words
> (only three official), that's one idea for the future that might be better
> than using a whole C on a singleton (or small) word class.
I expect there might be more n-words once we get into
tense-aspect-mood, so if we are going to have an all-purpose consonant
I'd rather it not be n-. I think z- is still available, and we've
talked about freeing up v- and g-.
What's t- been assigned for? This is a totally different topic, but I was thinking of
ta - present tense
ti, ti'e, ti'o - past, near past, far past
tu, tu'e, tu'o - future, near future, far future
Just an idea. "z-" is fine for the all purpose consonant, and we can always change it later.
So "he" seems to be something like a predicate place-holder. I wonder
whether we could get something like this to work too:
je la mlta he xkra la grka he
So in addition to:
formula := ... | j V termlist termlist formula
could we have:
formula := ... | j V termlist formula termlist
?
I'd like to un-condense our production rules to see what's going on. Right now what we hypothetically have is:
formula := simple-formula | modifier formula
modifier := term | termtree
simple-formula := stem VkV
termtree := empty-termtree | termtree-extender termtree
termtree-extender := term | coordinator termtree
empty-termtree := he explicit-sentence?
term := unary-operator | binder formula | coordinator formula
What we might like to admit as a formula is
coordinator termtree formula termtree
... which seems to reduce immediately to:
coordinator formula termtree
... and a following formula will consume the other termtree. Maybe
what would work is an afterthought (AT) termtree ("+" = added):
formula := simple-formula | modifier formula +| formula AT-termtree
modifier := term | termtree
simple-formula := stem VkV
+AT-termtree := empty-AT-termtree | AT-termtree-extender AT-termtree
+AT-termtree-extender := term | coordinator AT-termtree
+empty-AT-termtree := hi explicit-sentence?
termtree := empty-termtree | termtree-extender termtree
termtree-extender := term | coordinator termtree
empty-termtree := he explicit-sentence?
term := unary-operator | binder formula | coordinator formula
And perhaps even:
formula := ... | j V formula termlist termlist
je xkra la mlta he la xkra he
?
co ma'a xrxe