
www.Usenet.com
| <-- __Chronological__ --> | <-- __Thread__ --> |
Mike Atkinson <[EMAIL PROTECTED]> wrote in news:[EMAIL PROTECTED]: > Assuming you want parse x NOT y to be > the same tree as x AND NOT y and then > the following grammar would work (I think): > [ snipped ] Mike -- Thanks for the suggestion. This is essentially where I eventually arrived. It took some slogging, and the same [ <AND> ] suggestion from someone else, but I got there. I've really found this grammar/parsing stuff to be fascinating, and will certainly look more deeply into it. On amazon.com I found "Programming Language Processors in Java: Compilers and Interpreters", which seems to be a good introduction, using a language I can work with (i.e. not C++). -- Robert
| <-- __Chronological__ --> | <-- __Thread__ --> |