Re: ANN: examplotron.

[Murata Makoto <mura034@attglobal.net>]

Jonathan Borden wrote:

> is examplotron a type of hedge regular expression language?

Not yet.

> could you provide a simple example of a hedge regular expression and a
> slightly more complex one that uses this second star operator?

Here is an example in an XML-like notation.

	<para>* . @secContent ((<sec>@secContent<sec>) ^ @secContent)

The semantics of <sec>@secContent<sec> is "a section containing a 
substution variable @secContent".

The semantics of ((<sec>@secContent<sec>) ^ @secContent) "a section 
containing a section containing ... a section containing a 
substution variable @secContent".

The semantics of the entire expression is "generate a section 
which matches ((<sec>@secContent<sec>) ^ @secContent) and replace 
@secContent with paragraphs".

For each hedge regular grammar (e.g., descriptions in RELAX or TREX), 
there exists a hedge regular expression that represents exactly 
the same set of hedges.  Conversely, for each hedge regular expression, 
there exists a hedge regular grammar  that represents exactly 
the same set of hedges.

Cheers,

Makoto