Re: RM and abstract syntax trees
Date: Tue, 30 Oct 2007 19:00:29 -0700
Message-ID: <1193796029.446713.108270_at_k35g2000prh.googlegroups.com>
On Oct 31, 10:06 am, paul c <toledobythe..._at_ooyah.ac> wrote:
> David BL wrote:
> > On Oct 31, 2:46 am, paul c <toledobythe..._at_ooyah.ac> wrote:
> >> Okay, from your original post:
>
> >> "So RM is forced
> >> to expose the equivalent of pointers directly in the representation.
> >> Furthermore, the RM has no mechanism for hiding these pointers or
> >> giving the user an interface that promotes the idea that a node
> >> logically represents a value."
>
> >> Where does RM ever mention pointers? Eg., What are the pointer
> >> operations that RM supports?
>
> > I'm associating a "pointer" with the idea to give a thing (like a node
> > of an AST) some meaningless identifier, and using that identifier
> > elsewhere as a means to uniquely reference that thing. With that
> > *analogy*, RM performs a pointer dereference when performing a natural
> > join.
> > ...
>
> Sorry if this seems pedantic (which it is) but RM references things
> uniquely with values.
I have no problem with you being pedantic and like your comments!
Yes RM references things uniquely with values, but pointers are "value types"! Note the distinction between "pointer-type", "pointervariable", and "pointer-value". When a pointer-variable is assigned a pointer-value, the object being referenced only depends on the pointer-value.
In the end I'm more interested in whether you agree with the conclusion : that RM is ill-suited to represent ASTs. Received on Wed Oct 31 2007 - 03:00:29 CET
