W3C home > Mailing lists > Public > www-html@w3.org > March 1998

Re: Composing language descriptions: tree automata and language design?

From: Paul Prescod <papresco@technologist.com>
Date: Mon, 2 Mar 1998 11:51:46 -0500 (EST)
Message-ID: <34FAE3C5.F67194F@technologist.com>
To: MURATA Makoto <murata@apsdc.ksp.fujixerox.co.jp>
CC: Dan Connolly <connolly@w3.org>, fork@xent.ics.uci.edu, www-html@w3.org
MURATA Makoto wrote:
> Forest regular expressions provide both schemas and parameterization.
> Forest regular expressions are parameterized; they contain subsitution
> variables that can later be replaced with other forest regular expressions.
> Forest regular expressions are schemas; they are equivalent to forest
> automatons in describing a set of permissible forests.

Something like the Toru Takahashi proposal would allow me to incorporate
MATHML into a parameterized HTML somewhat like this:

<!MODULE mathml SYSTEM "http://.../mathml.mod">
	SYSTEM "http://.../html.mod">

(I just invented an extension to make it more readable) 

Can you easily come up with an example of how I would use FA's to do the

Paul Prescod  - http://itrc.uwaterloo.ca/~papresco

[Woody Allen on Hollywood in "Annie Hall"]
Annie: "It's so clean down here."
Woody: "That's because they don't throw their garbage away. They make 
        it into television shows."
Received on Monday, 2 March 1998 11:57:25 UTC

This archive was generated by hypermail 2.4.0 : Thursday, 30 April 2020 16:20:33 UTC