Posts Mentioning RSS Toggle Comment Threads | Keyboard Shortcuts

  • Ralph 5:20 pm on November 21, 2009 Permalink  

    wormhole parser generator 0.5.0.1 released 

    Wormhole parser generator 0.5.0.1 was just released, which contains some minor bug fixes to 0.5.  Download at the usual place.

     
  • Ralph 8:03 pm on November 18, 2009 Permalink  

    Wormhole parser generator release 0.5, enters BETA 2 

    If you’ve got the guts, download the latest wormhole parser generator.  With satisfactory optimizations in place, I’ve wrapped up the 0.4 series, and we’re on to BETA 2.  I’ll be quite busy for the foreseeable future, so while I’ll be doing bug fixes as they are needed there will be no big overhauls or new features for awhile.  As usual, if you need features, feel free to send patches.

    * The demonstrative performance grammar now runs in 26 seconds. It solves the grammar in 15 seconds (that’s on my box, a relatively underpowered Toshiba laptop. your mileage will vary) followed by another 11 seconds to emit the grammar files.

    * Fixed a few other random bugs.

    Happy Parsing!

     
  • Ralph 12:44 am on November 14, 2009 Permalink  

    wormhole parser generator 0.4.3.3 released 

    Download the latest wormhole parser generator, 0.4.3.3,  if you dare.

    • You can include more than one generated parser in the same module, provided you use the -n option to name the grammar interface class factory functions differently.
    • I put in some significant performance improvements.  The wait for the wormhole bootstrapper and other such small to medium size grammars has virtually vanished (1 to 2 seconds).  On big grammars (300+ productions, 20 part expression precedence, a handful of forbid rules, deep pruning on all your if-else grammar constructs) your wait time is no longer 40 minutes, it is roughly 2.5 minutes.
    • Expect one more round of optimizations to cap off the 0.4 series.  The profile numbers say I can do better on the big grammars, like maybe as low as 3 to 5 seconds.  Not much lower though, the grammar-grammar parsing and Unicode lexer generation steps are already virtually nil.  I may be able to get the solver squeezed down to only a second or two on the big solves, but I’ll probably never revert to a C code generator; it’s too much of a hassle.

    Any upgrades beyond 0.5 will not be out for some time, perhaps a year or more.  I currently have no need or demand for generating parsers in additional programming languages.  I will be using my time to write commercial software.  Stay tuned for announcements and screen shots.

     
c
compose new post
j
next post/next comment
k
previous post/previous comment
r
reply
e
edit
o
show/hide comments
t
go to top
l
go to login
h
show/hide help
esc
cancel