🚀 go-pugleaf

In article <1992Jul28.101919.15524@fcom.cc.utah.edu>, burchard@horizon.math.utah.edu (Paul Burchard) writes:
|> Anyone know of any decent dynamic parsers out there on the net?  (By "dynamic"  
|> I mean that grammar rules can be added while the parser is running.)
|> 
|> It seems that the bison source could be hacked up to do this, but that's a  
|> hefty wheel to reinvent and I'm hoping it's already been done...
|> 
Oops! ( ;-) double meaning...)

That would not be too easy, because normally you want to add actions to your
new rules. If you do not want to write an interpreter, you will have to 
run the compiler anyway. I think it is not possible to add a rule without
a complete rework on the tables.

Another thing is that I just went along and 'objected' (or, better, C++-ified)
Bison and Flex such that you have a 'main class' that has all the code that
is used for all parsers/scanners and several sub-classes that consists of
the tables and the special actions. If you have interest in these, e-mail me,
but be warned that this code is really not-yet-ready (working at the moment,
but not too-well tested...)

Uli Grepel