| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> If you were to implement the original relation algebra language...
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 - 13:15:39 CST
![]() |
![]() |