A
Alexander Demenchuk
Beaver is a LALR(1) parser generator. It takes a context free grammar
as an input and converts it into a Java class that implements a parser
for the specified language.
Beaver is similar to CUP and other LALR parser generators, yet it has
several important differences:
- it is very fast (almost 5 times faster than CUP, probably as fast as
a LALR Java parser can get due to the use of perfectly hashed action
tables)
- it uses some EBNF notations in grammar syntax to allow more compact
specifications
- it is implemented to allow multiple parser instances to work in
parallel
- its instances can be reused
- it can be easily integrated in a development environment
Beaver's home is at http://beaver.sourceforge.net
Enjoy
as an input and converts it into a Java class that implements a parser
for the specified language.
Beaver is similar to CUP and other LALR parser generators, yet it has
several important differences:
- it is very fast (almost 5 times faster than CUP, probably as fast as
a LALR Java parser can get due to the use of perfectly hashed action
tables)
- it uses some EBNF notations in grammar syntax to allow more compact
specifications
- it is implemented to allow multiple parser instances to work in
parallel
- its instances can be reused
- it can be easily integrated in a development environment
Beaver's home is at http://beaver.sourceforge.net
Enjoy