Re: about OpenToken

[Stephen Leake <stephen_leake@acm.org>]

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> writes:

> On Sun, 11 Dec 2005 19:23:38 +0100, Lionel Draghi wrote:
>
>> I expect the code representing the grammar to be almost as simple as the 
>> BNF expression.
>
> Well, that depends. Consider comments and line feeds allowed between the
> keywords. To represent this in BNF, I don't think it will be such simple
> expression.

OpenToken does comments and white space in the lexer level, not the
grammar level.

I don't think you can define a keyword as whitespace, but it's an
interesting idea.

>> If an optionnal word requires a bunch of code, I would say that there's 
>> something to improve.
>
> There are many approaches to parsing. I am using table driven parsers. For
> a descent recursive parser I just change the table to match the source
> against depending on the context. I presume that something similar can be
> done with OpenToken as well.

Yes, you can.

-- 
-- Stephe