If you were to implement the original relation algebra language...

From: Amund Trov�g <amundAndHereEndethMyName_at_removeINOLIKESPAMYOUSEEtexassibir.com>
Date: Thu, 20 Nov 2003 20:15:39 +0100
Message-ID: <3FBD12DB.40205_at_removeINOLIKESPAMYOUSEEtexassibir.com>

Would precedence have a lot to say for optimization?

I am currently working on doing just this, creating the grammar file from BNF to JavaCC(a program that makes Java parser files for me, based on a grammar).

I am not certain whether project should have precedence over the other operators, as this might create trouble when combined with e.g. selection.

Any thoughts, comments or tips on how the grammar should be structured with regard to this?

Sincerely,
Amund Trov�g Received on Thu Nov 20 2003 - 20:15:39 CET

This message: [ Message body ]
Next message: Lauri Pietarinen: "Re: What is a Relationship !?"
Previous message: Tom Hester: "Re: What is a Relationship !?"
Next in thread: Joe \: "Re: If you were to implement the original relation algebra language..."
Reply: Joe \: "Re: If you were to implement the original relation algebra language..."

Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ]

Original text of this message