Does anybody have working examples of a Parsing Expression Grammar
(http://en.wikipedia.org/wiki/Parsing_expression_grammar) for a Java
like language? I know the Rats! package generates parsers based on
PEG, but since Rats! is GPL`d I can`t use it for commercial use. It
would help to actually see the set of needed production rules for the
Java language as a base for designing a new language.

The reason for this is that I have a working VM implementation that I
need to test feed with bytecode samples, so it makes sense to start
bringing in the compiler step. As opposed to LL and RL parsers, PEG
parsers seem both more efficient AND unambiguous and handle context
free languages. I was wondering if Java, apart from the usual dangling
else conflicts, has been frame already in a PEG?