Re: RM and abstract syntax trees
From: paul c <toledobythesea_at_ooyah.ac>
Date: Wed, 31 Oct 2007 01:06:25 GMT
Message-ID: <lyQVi.162446$th2.72407_at_pd7urf3no>
Date: Wed, 31 Oct 2007 01:06:25 GMT
Message-ID: <lyQVi.162446$th2.72407_at_pd7urf3no>
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. Received on Wed Oct 31 2007 - 02:06:25 CET