Re: Regular Tree Grammar vs. Context-Free Grammar
- From: haberg@xxxxxxxxxx (Hans Aberg)
- Date: Sun, 10 Dec 2006 19:08:06 GMT
In article <87irgjdd8d.fsf@xxxxxxxxx>, Ben Bacarisse
<ben.usenet@xxxxxxxxx> wrote:
Perhaps you might add this to:
http://en.wikipedia.org/wiki/Regular_tree_grammar
I am a little unsure about the value of saying anything. The trouble
is that the equivalence is not very formal. The Languages of RTGs are sets
of trees and those of CFGs are sets of strings.
All one can say, formally, is that one can construct a CFG whose
language can be mapped to that of the RTG with a rather trivial 1-to-1
function. There is no CFG that describes the same language as an RTG.
I did not look at the equivalence so much in detail. But I am working with
tree languages in order to achieve syntactic independence (in the context
of a theorem prover) - I do not know how that relates to this stuff.
But if one has a formal theory of trees, then one can construct a
formal theory of strings by writing each tree such that the
tree comes back when parsed. For example, one might use Lukasiewicz
(prefix) notation.
It seems you do something similar.
--
Hans Aberg
.
- References:
- Regular Tree Grammar vs. Context-Free Grammar
- From: Eric Wohlstadter
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Ben Bacarisse
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Hans Aberg
- Re: Regular Tree Grammar vs. Context-Free Grammar
- From: Ben Bacarisse
- Regular Tree Grammar vs. Context-Free Grammar
- Prev by Date: Re: Regular Tree Grammar vs. Context-Free Grammar
- Next by Date: Re: An easy way to prove P != NP
- Previous by thread: Re: Regular Tree Grammar vs. Context-Free Grammar
- Next by thread: Re: Regular Tree Grammar vs. Context-Free Grammar
- Index(es):
Relevant Pages
|