Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: RM and abstract syntax trees

Re: RM and abstract syntax trees

From: Marshall <marshall.spight_at_gmail.com>
Date: Thu, 01 Nov 2007 03:24:32 -0000
Message-ID: <1193887472.502254.261020@v29g2000prd.googlegroups.com>


On Oct 31, 5:29 pm, David BL <davi..._at_iinet.net.au> wrote:
> On Nov 1, 7:23 am, Tegiri Nenashi <TegiriNena..._at_gmail.com> wrote:
>
> > So? What power Lisp gives you in the realm of languages and grammars?
>
> I don't understand you. My point is that Lisp doesn't expect you to
> name the subexpressions because the underlying implementation
> allocates cons cells and use pointers to represent the structure.

I think it would be fair to say that LISP provides enormous benefits to processing languages and grammars, provided your syntax is exactly S-expressions. I am not being sarcastic here.

Marshall Received on Wed Oct 31 2007 - 22:24:32 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US