|OQL Parser/Interpreter email@example.com (Scott Stubbs) (1998-07-31)|
|Re: OQL Parser/Interpreter Torsten.Grust@uni-konstanz.de (Torsten Grust) (1998-08-03)|
|From:||Torsten Grust <Torsten.Grust@uni-konstanz.de>|
|Date:||3 Aug 1998 17:54:45 -0400|
|Organization:||Database Research Group, U Konstanz (Lake Constance)|
"Scott Stubbs" <firstname.lastname@example.org> writes:
> I have been working on a simple OQL engine for a while now and seem to have
> the parser working just right. However, I have found that interpreting or
> executing the OQL is a whole 'nother animal.
> The question I ask is: Has anyone been able to successfully create a walker
> for OQL? If so, I would like to know what techniques you used to solve your
Efficient compilation of OQL is one of our main concerns, too. We
have devised a compilation and execution scheme for OQL that is based
on monad (monoid) comprehensions and structural recursion. Pointers
to this work may be found from my homepage (there are also links to a
web interface for a parser and type checker for OQL).
I also recommend to have a look at Leonidas Fegaras' work (U Texas of
Arlington) on this subject:
| Torsten Grust Torsten.Grust@uni-konstanz.de |
| http://www.fmi.uni-konstanz.de/~grust/ |
| Database Research Group, University of Konstanz (Lake Constance/Germany) |
Return to the
Search the comp.compilers archives again.