|Compiler compiler that supports dynamic keywords? email@example.com (Ramon M. Felciano) (1999-09-10)|
|Re: Compiler compiler that supports dynamic keywords? firstname.lastname@example.org (Chris F Clark) (1999-09-16)|
|Re: Compiler compiler that supports dynamic keywords? email@example.com (Quinn Tyler Jackson) (1999-10-13)|
|From:||"Quinn Tyler Jackson" <firstname.lastname@example.org>|
|Date:||13 Oct 1999 01:18:45 -0400|
> The key is that the definition of <nameType1> and <nameType2> needs to
> be changeable at runtime. For example, <nameType1> might be words
> defined in dictionary A, and <nameType2> be words defined in
> dictionary B. Thus this grammar would parse and recognize sentences
> where the first word is "Hello" and the second word is in one of those
> two dictionaries (I'm willing to guarantee mutual exclusivity of
> dictionary membership); all other sentences are rejected. Ideally this
> rejection should happen after the (bad) second word is entered.
PAISLEI can generate grammars that acquire and use tokens parsed from
the stream, or you can populate your dictionaries before a parse
The examples with the currently available version at
http://www.qtj.net/~lpm/ demonstrate how it does this. Version 2.0
will have better examples of this, but has not yet gone into beta.
(Should be entering beta in a few weeks.)
Also, the online paper:
covers similar concepts in patterns 14 through 17, based upon lexemes
acquired in pattern 7.
(Or at least they seem like similar concepts at this hour of the night...)
Quinn Tyler Jackson
Return to the
Search the comp.compilers archives again.