User:David Nemeskey/CG XML brainstorming

This page lists my (and others') ideas of how the CG XML format could or should look like.

Sets and lists

The words set and list are used interchangeably in CG. This is in contrast to how these term are used in CS, and partly to the commonsensical meanings of the words as well. The current planning process might be just the right time to fix this issue. I propose to say good-bye to list.

The (XML) tags below will be used throughout the grammar for specifying tags and sets in e.g. constraint conditions.

Item	CG syntax	XML syntax	Fran's suggestion
Regular tag	nom	<tag>nom</tag>	<tag n="nom"/>
Sequence tag	(n pl)	<seq><tag>n</tag><tag>pl</tag></seq>
Reading base-form	"dog"	<lemma>dog</lemma>
Word-form	"<dogs>"	<word>dogs</word>
Set	(...)	see below
Special tags	>>> and <<<	<sbegin/> and <send/>

Observations:

1. seq and set are very similar, which might be a problem when skimming through a CG
2. I don't know if we even need set -- in the construction rules, you have to put sets to everywhere, and those will have separate XML tags anyway.
3. seq could be combined(-tag)?

Delimiters

Probably the easiest of the bunch:

<delimiters>(word forms, sets, etc.)</delimiters>

Alternative set handling

Set are defined (unhammer is right in that actual modification never happens) in the <sets>...</sets> section.

There are two kinds of sets in CG: named and temporary. The obvious first question is: do we represent them as two different tags, or not? The two options are listed below:

Set type	CG syntax	XML syntax 1	XML syntax 2
Named	Nominal	<nset name="Nominal"/>	<set name="Nominal"/>
Temporary	(n) OR (adj)	<set><or><tag n="n"/><tag n="adj"/></or></set>	<set><or><tag n="n"/><tag n="adj"/></or></set>

Well, the two options are almost the same, and both are very easy to write a parser for. However, I am a bit concerned about the (human) readability of the latter.

As for set definition, there are currently two ways to do that: with the LIST and the SET keywords. The former is a big OR of tags (inc. lemmas and sequences), while the latter builds sets from other sets. Again, we have two options here: we can either just have one tag (e.g. set), and it is up to the user to follow the conventions; or we can have separate tags for the two. I propose the latter:

Item	CG syntax	XML syntax
Basic set	LIST set-name = ... ;	<basic-set name="set-name">...</basic-set> <bset name="set-name">...</bset>
"Meta" set*	SET set-name = ... ;	<meta-set name="set-name">...</meta-set> <mset name="set-name">...</mset>

(*) Suggestions on how to call this tag are welcome.

The ... in a meta set definition, as well as in case of temporary sets, can include the following set operations:

Operation	CG syntax	XML syntax
Union	A OR B	<union><set name="A"><set name="B"></union> <or><set name="A"><set name="B"></or>
Concatenation	A + B	<concat><set name="A"><set name="B"></concat>
Difference	A - B	<diff><set name="A"><set name="B"></diff>

Note: The operation tags above can be thought of as functions that return a new set, e.g. or(A, concat(B, C), diff (D, E)). This format has the benefit of explicitly encoding the precedence in the formula, so grammarians won't have to memorize it.

Sets (the original idea)

Set definitions and modifications. The section itself in enclosed in a <sets>...</sets> tag.

Item	CG syntax	XML syntax
Set definition	LIST set-name = ... ;	<define-set name="set-name">...</define-set> <dset name="set-name">...</dset>
Set modification	SET set-name = ... ;	<modify-set name="set-name">...</modify-set> <mset name="set-name">...</mset>

The define-set tag works exactly like set, the only exception is that the former is named and can only be used in the SETS sections. The ... in set modification can include the following set operations:

Operation	CG syntax	XML syntax
Union	A OR B	<union>???A???B???</union> <or>???A???B???<or>
Concatenation	A + B	<concat>???A???B???</concat>
Difference	A - B	<diff>???A???B???<diff>

Note: I imagine the above to be akin to lisp operators, e.g. (or A (concat B C) (diff D E)). This format has the benefit of explicitly encoding the precedence in the formula, so grammarians won't have to memorize it.

CG never modifies sets. You can define one set based on other sets, but that's a new set definition, not an old set being changed. --unhammer 05:42, 28 June 2013 (UTC)