A
Alexander Demenchuk
[Removed invalid group comp.lang.java.developer - moderator]
Beaver is a LALR(1) parser generator for Java. It applies several techniques to
make
generated parsers very fast - possibly as fast as a LALR parser can get:
o Parsing tables are build using row displacement scheme, which produces
tables
with O(1) lookup time. They behave as if they are perfectly hashed.
o Action routines are invoked via delegates, which give constant invocation
time,
no matter how many routines are defined.
0.9.3 adds more features to code generation, so manually building ASTs is even
easier
now (automatic AST generation is planned for 0.9.4). In this version Beaver
bootstraps
itself, giving yet another real-wolrd example of building compilers using Beaver
generated parsers.
More information can be found at http://beaver.sourceforge.net/
Beaver is a LALR(1) parser generator for Java. It applies several techniques to
make
generated parsers very fast - possibly as fast as a LALR parser can get:
o Parsing tables are build using row displacement scheme, which produces
tables
with O(1) lookup time. They behave as if they are perfectly hashed.
o Action routines are invoked via delegates, which give constant invocation
time,
no matter how many routines are defined.
0.9.3 adds more features to code generation, so manually building ASTs is even
easier
now (automatic AST generation is planned for 0.9.4). In this version Beaver
bootstraps
itself, giving yet another real-wolrd example of building compilers using Beaver
generated parsers.
More information can be found at http://beaver.sourceforge.net/